java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/psyco/psyco_security.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:24:25,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:24:25,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:24:25,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:24:25,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:24:25,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:24:25,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:24:25,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:24:25,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:24:25,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:24:25,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:24:25,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:24:25,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:24:25,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:24:25,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:24:25,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:24:25,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:24:25,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:24:25,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:24:25,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:24:25,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:24:25,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:24:25,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:24:25,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:24:25,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:24:25,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:24:25,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:24:25,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:24:25,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:24:25,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:24:25,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:24:25,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:24:25,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:24:25,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:24:25,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:24:25,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:24:25,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:24:25,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:24:25,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:24:25,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:24:25,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:24:25,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:24:25,224 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:24:25,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:24:25,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:24:25,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:24:25,226 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:24:25,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:24:25,226 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:24:25,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:24:25,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:24:25,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:24:25,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:24:25,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:24:25,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:24:25,228 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:24:25,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:24:25,228 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:24:25,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:24:25,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:24:25,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:24:25,229 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:24:25,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:24:25,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:24:25,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:24:25,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:24:25,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:24:25,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:24:25,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:24:25,231 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:24:25,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:24:25,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:24:25,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:24:25,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:24:25,531 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:24:25,532 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:24:25,532 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_security.c [2019-10-15 03:24:25,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f6a29c62/3475658c1cd7417b98cc72b01d6fb9cc/FLAGa8e1ee5fa [2019-10-15 03:24:26,138 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:24:26,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security.c [2019-10-15 03:24:26,149 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f6a29c62/3475658c1cd7417b98cc72b01d6fb9cc/FLAGa8e1ee5fa [2019-10-15 03:24:26,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f6a29c62/3475658c1cd7417b98cc72b01d6fb9cc [2019-10-15 03:24:26,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:24:26,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:24:26,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:24:26,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:24:26,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:24:26,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:24:26" (1/1) ... [2019-10-15 03:24:26,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65982a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:26, skipping insertion in model container [2019-10-15 03:24:26,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:24:26" (1/1) ... [2019-10-15 03:24:26,575 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:24:26,634 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:24:26,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:24:26,848 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:24:26,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:24:26,995 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:24:26,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:26 WrapperNode [2019-10-15 03:24:26,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:24:26,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:24:26,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:24:27,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:24:27,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:26" (1/1) ... [2019-10-15 03:24:27,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:26" (1/1) ... [2019-10-15 03:24:27,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:26" (1/1) ... [2019-10-15 03:24:27,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:26" (1/1) ... [2019-10-15 03:24:27,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:26" (1/1) ... [2019-10-15 03:24:27,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:26" (1/1) ... [2019-10-15 03:24:27,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:26" (1/1) ... [2019-10-15 03:24:27,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:24:27,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:24:27,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:24:27,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:24:27,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:24:27,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:24:27,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:24:27,110 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:24:27,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:24:27,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:24:27,110 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:24:27,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:24:27,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:24:27,658 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:24:27,658 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-10-15 03:24:27,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:24:27 BoogieIcfgContainer [2019-10-15 03:24:27,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:24:27,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:24:27,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:24:27,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:24:27,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:24:26" (1/3) ... [2019-10-15 03:24:27,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed409bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:24:27, skipping insertion in model container [2019-10-15 03:24:27,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:26" (2/3) ... [2019-10-15 03:24:27,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed409bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:24:27, skipping insertion in model container [2019-10-15 03:24:27,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:24:27" (3/3) ... [2019-10-15 03:24:27,668 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2019-10-15 03:24:27,679 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:24:27,687 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:24:27,699 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:24:27,724 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:24:27,725 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:24:27,725 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:24:27,725 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:24:27,725 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:24:27,725 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:24:27,726 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:24:27,726 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:24:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-10-15 03:24:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:24:27,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:27,753 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:27,755 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:27,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1018079574, now seen corresponding path program 1 times [2019-10-15 03:24:27,772 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:27,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532287237] [2019-10-15 03:24:27,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:27,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:27,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:24:27,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532287237] [2019-10-15 03:24:27,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:27,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 03:24:27,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921417508] [2019-10-15 03:24:27,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 03:24:27,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 03:24:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 03:24:27,922 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2019-10-15 03:24:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:27,954 INFO L93 Difference]: Finished difference Result 159 states and 297 transitions. [2019-10-15 03:24:27,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 03:24:27,956 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-15 03:24:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:27,969 INFO L225 Difference]: With dead ends: 159 [2019-10-15 03:24:27,969 INFO L226 Difference]: Without dead ends: 77 [2019-10-15 03:24:27,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 03:24:27,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-15 03:24:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-10-15 03:24:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-15 03:24:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2019-10-15 03:24:28,024 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 12 [2019-10-15 03:24:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:28,025 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 112 transitions. [2019-10-15 03:24:28,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 03:24:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2019-10-15 03:24:28,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:24:28,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:28,027 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:28,027 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:28,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:28,028 INFO L82 PathProgramCache]: Analyzing trace with hash -963203793, now seen corresponding path program 1 times [2019-10-15 03:24:28,028 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:28,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517044685] [2019-10-15 03:24:28,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:24:28,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517044685] [2019-10-15 03:24:28,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:28,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:28,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653677632] [2019-10-15 03:24:28,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:28,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:28,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:28,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:28,083 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand 3 states. [2019-10-15 03:24:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:28,168 INFO L93 Difference]: Finished difference Result 152 states and 223 transitions. [2019-10-15 03:24:28,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:28,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-15 03:24:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:28,170 INFO L225 Difference]: With dead ends: 152 [2019-10-15 03:24:28,171 INFO L226 Difference]: Without dead ends: 80 [2019-10-15 03:24:28,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-15 03:24:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-15 03:24:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-15 03:24:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2019-10-15 03:24:28,184 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 13 [2019-10-15 03:24:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:28,185 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2019-10-15 03:24:28,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2019-10-15 03:24:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:24:28,186 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:28,186 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:28,187 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:28,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:28,187 INFO L82 PathProgramCache]: Analyzing trace with hash -821291411, now seen corresponding path program 1 times [2019-10-15 03:24:28,188 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:28,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888056156] [2019-10-15 03:24:28,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:24:28,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888056156] [2019-10-15 03:24:28,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:28,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:28,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147965028] [2019-10-15 03:24:28,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:28,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:28,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:28,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:28,247 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand 3 states. [2019-10-15 03:24:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:28,320 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2019-10-15 03:24:28,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:28,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 03:24:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:28,326 INFO L225 Difference]: With dead ends: 145 [2019-10-15 03:24:28,326 INFO L226 Difference]: Without dead ends: 71 [2019-10-15 03:24:28,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-15 03:24:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-10-15 03:24:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-15 03:24:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2019-10-15 03:24:28,338 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 18 [2019-10-15 03:24:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:28,338 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2019-10-15 03:24:28,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2019-10-15 03:24:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:24:28,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:28,340 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:28,340 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:28,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2110126326, now seen corresponding path program 1 times [2019-10-15 03:24:28,341 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:28,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087031182] [2019-10-15 03:24:28,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:24:28,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087031182] [2019-10-15 03:24:28,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:28,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:28,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948753376] [2019-10-15 03:24:28,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:28,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:28,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:28,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:28,396 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand 3 states. [2019-10-15 03:24:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:28,527 INFO L93 Difference]: Finished difference Result 191 states and 279 transitions. [2019-10-15 03:24:28,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:28,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 03:24:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:28,529 INFO L225 Difference]: With dead ends: 191 [2019-10-15 03:24:28,530 INFO L226 Difference]: Without dead ends: 121 [2019-10-15 03:24:28,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-15 03:24:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2019-10-15 03:24:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-15 03:24:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2019-10-15 03:24:28,543 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 21 [2019-10-15 03:24:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:28,543 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2019-10-15 03:24:28,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2019-10-15 03:24:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 03:24:28,545 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:28,545 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:28,545 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:28,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash -335735957, now seen corresponding path program 1 times [2019-10-15 03:24:28,546 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:28,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294386304] [2019-10-15 03:24:28,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:24:28,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294386304] [2019-10-15 03:24:28,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:28,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:28,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041253178] [2019-10-15 03:24:28,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:28,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:28,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:28,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:28,609 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand 3 states. [2019-10-15 03:24:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:28,659 INFO L93 Difference]: Finished difference Result 182 states and 259 transitions. [2019-10-15 03:24:28,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:28,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 03:24:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:28,661 INFO L225 Difference]: With dead ends: 182 [2019-10-15 03:24:28,661 INFO L226 Difference]: Without dead ends: 86 [2019-10-15 03:24:28,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-15 03:24:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-10-15 03:24:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-15 03:24:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2019-10-15 03:24:28,670 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 22 [2019-10-15 03:24:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:28,671 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2019-10-15 03:24:28,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2019-10-15 03:24:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 03:24:28,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:28,673 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:28,673 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:28,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:28,673 INFO L82 PathProgramCache]: Analyzing trace with hash -433676134, now seen corresponding path program 1 times [2019-10-15 03:24:28,674 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:28,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285625960] [2019-10-15 03:24:28,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:24:28,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285625960] [2019-10-15 03:24:28,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:28,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:28,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488729387] [2019-10-15 03:24:28,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:28,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:28,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:28,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:28,712 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand 3 states. [2019-10-15 03:24:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:28,750 INFO L93 Difference]: Finished difference Result 133 states and 189 transitions. [2019-10-15 03:24:28,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:28,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 03:24:28,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:28,753 INFO L225 Difference]: With dead ends: 133 [2019-10-15 03:24:28,753 INFO L226 Difference]: Without dead ends: 69 [2019-10-15 03:24:28,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:28,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-15 03:24:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-10-15 03:24:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-15 03:24:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2019-10-15 03:24:28,769 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 28 [2019-10-15 03:24:28,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:28,769 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2019-10-15 03:24:28,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2019-10-15 03:24:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 03:24:28,771 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:28,771 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:28,777 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:28,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:28,777 INFO L82 PathProgramCache]: Analyzing trace with hash 94612443, now seen corresponding path program 1 times [2019-10-15 03:24:28,777 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:28,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411839673] [2019-10-15 03:24:28,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:24:28,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411839673] [2019-10-15 03:24:28,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:28,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:28,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117666078] [2019-10-15 03:24:28,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:28,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:28,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:28,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:28,851 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand 3 states. [2019-10-15 03:24:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:28,928 INFO L93 Difference]: Finished difference Result 157 states and 227 transitions. [2019-10-15 03:24:28,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:28,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 03:24:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:28,930 INFO L225 Difference]: With dead ends: 157 [2019-10-15 03:24:28,930 INFO L226 Difference]: Without dead ends: 110 [2019-10-15 03:24:28,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-15 03:24:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2019-10-15 03:24:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-15 03:24:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2019-10-15 03:24:28,940 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 29 [2019-10-15 03:24:28,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:28,940 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2019-10-15 03:24:28,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:28,941 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2019-10-15 03:24:28,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 03:24:28,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:28,942 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:28,942 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:28,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:28,943 INFO L82 PathProgramCache]: Analyzing trace with hash -211148245, now seen corresponding path program 1 times [2019-10-15 03:24:28,943 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:28,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514807100] [2019-10-15 03:24:28,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:28,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:24:28,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514807100] [2019-10-15 03:24:28,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:28,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:28,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702664567] [2019-10-15 03:24:28,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:28,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:28,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:28,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:28,987 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand 3 states. [2019-10-15 03:24:29,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:29,030 INFO L93 Difference]: Finished difference Result 165 states and 231 transitions. [2019-10-15 03:24:29,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:29,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 03:24:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:29,032 INFO L225 Difference]: With dead ends: 165 [2019-10-15 03:24:29,032 INFO L226 Difference]: Without dead ends: 91 [2019-10-15 03:24:29,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:29,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-15 03:24:29,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-10-15 03:24:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-15 03:24:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 119 transitions. [2019-10-15 03:24:29,040 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 119 transitions. Word has length 30 [2019-10-15 03:24:29,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:29,041 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 119 transitions. [2019-10-15 03:24:29,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 119 transitions. [2019-10-15 03:24:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 03:24:29,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:29,042 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:29,043 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:29,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash -74794090, now seen corresponding path program 1 times [2019-10-15 03:24:29,043 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:29,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449091859] [2019-10-15 03:24:29,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:29,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:29,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:24:29,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449091859] [2019-10-15 03:24:29,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:29,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:29,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173426727] [2019-10-15 03:24:29,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:29,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:29,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:29,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:29,075 INFO L87 Difference]: Start difference. First operand 91 states and 119 transitions. Second operand 3 states. [2019-10-15 03:24:29,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:29,115 INFO L93 Difference]: Finished difference Result 138 states and 183 transitions. [2019-10-15 03:24:29,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:29,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 03:24:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:29,116 INFO L225 Difference]: With dead ends: 138 [2019-10-15 03:24:29,116 INFO L226 Difference]: Without dead ends: 71 [2019-10-15 03:24:29,117 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:29,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-15 03:24:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-10-15 03:24:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-15 03:24:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-10-15 03:24:29,129 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 30 [2019-10-15 03:24:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:29,130 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-10-15 03:24:29,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-10-15 03:24:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 03:24:29,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:29,134 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:29,134 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:29,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:29,135 INFO L82 PathProgramCache]: Analyzing trace with hash -963440826, now seen corresponding path program 1 times [2019-10-15 03:24:29,135 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:29,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731408] [2019-10-15 03:24:29,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:29,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:29,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:24:29,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731408] [2019-10-15 03:24:29,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:29,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:29,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527458216] [2019-10-15 03:24:29,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:29,188 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:29,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:29,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:29,189 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 3 states. [2019-10-15 03:24:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:29,229 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2019-10-15 03:24:29,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:29,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 03:24:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:29,230 INFO L225 Difference]: With dead ends: 73 [2019-10-15 03:24:29,231 INFO L226 Difference]: Without dead ends: 69 [2019-10-15 03:24:29,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-15 03:24:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-10-15 03:24:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-15 03:24:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2019-10-15 03:24:29,236 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 31 [2019-10-15 03:24:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:29,237 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2019-10-15 03:24:29,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2019-10-15 03:24:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 03:24:29,238 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:29,238 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:29,238 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:29,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:29,239 INFO L82 PathProgramCache]: Analyzing trace with hash 209555688, now seen corresponding path program 1 times [2019-10-15 03:24:29,239 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:29,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674968773] [2019-10-15 03:24:29,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:29,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:29,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:24:29,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674968773] [2019-10-15 03:24:29,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:29,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:29,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423743014] [2019-10-15 03:24:29,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:29,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:29,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:29,283 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand 3 states. [2019-10-15 03:24:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:29,317 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2019-10-15 03:24:29,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:29,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-15 03:24:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:29,318 INFO L225 Difference]: With dead ends: 110 [2019-10-15 03:24:29,318 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:24:29,319 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:24:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:24:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:24:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:24:29,320 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-10-15 03:24:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:29,321 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:24:29,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:24:29,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:24:29,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:24:29,433 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:24:29,433 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:24:29,433 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:24:29,433 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:24:29,433 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:24:29,434 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:24:29,434 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 331) no Hoare annotation was computed. [2019-10-15 03:24:29,434 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 382) no Hoare annotation was computed. [2019-10-15 03:24:29,434 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 261) no Hoare annotation was computed. [2019-10-15 03:24:29,434 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 390) no Hoare annotation was computed. [2019-10-15 03:24:29,434 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 199) no Hoare annotation was computed. [2019-10-15 03:24:29,435 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 129) no Hoare annotation was computed. [2019-10-15 03:24:29,435 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 377) no Hoare annotation was computed. [2019-10-15 03:24:29,435 INFO L443 ceAbstractionStarter]: For program point L300(lines 300 315) no Hoare annotation was computed. [2019-10-15 03:24:29,435 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 245) no Hoare annotation was computed. [2019-10-15 03:24:29,435 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2019-10-15 03:24:29,435 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2019-10-15 03:24:29,435 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 299) no Hoare annotation was computed. [2019-10-15 03:24:29,436 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 229) no Hoare annotation was computed. [2019-10-15 03:24:29,437 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-10-15 03:24:29,437 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 345) no Hoare annotation was computed. [2019-10-15 03:24:29,437 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 213) no Hoare annotation was computed. [2019-10-15 03:24:29,437 INFO L443 ceAbstractionStarter]: For program point L70(lines 70 72) no Hoare annotation was computed. [2019-10-15 03:24:29,437 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 329) no Hoare annotation was computed. [2019-10-15 03:24:29,437 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2019-10-15 03:24:29,438 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 56) no Hoare annotation was computed. [2019-10-15 03:24:29,438 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 313) no Hoare annotation was computed. [2019-10-15 03:24:29,438 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 390) no Hoare annotation was computed. [2019-10-15 03:24:29,438 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 172) no Hoare annotation was computed. [2019-10-15 03:24:29,438 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 297) no Hoare annotation was computed. [2019-10-15 03:24:29,438 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 156) no Hoare annotation was computed. [2019-10-15 03:24:29,440 INFO L439 ceAbstractionStarter]: At program point L22-2(lines 22 385) the Hoare annotation is: (or (and (<= main_~this_state~0 0) (= main_~q~0 0)) (and (= main_~this_state~0 3) (<= 4 main_~q~0))) [2019-10-15 03:24:29,440 INFO L443 ceAbstractionStarter]: For program point L22-3(lines 22 385) no Hoare annotation was computed. [2019-10-15 03:24:29,440 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-10-15 03:24:29,440 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 140) no Hoare annotation was computed. [2019-10-15 03:24:29,440 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-10-15 03:24:29,441 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2019-10-15 03:24:29,441 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-10-15 03:24:29,441 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 240) no Hoare annotation was computed. [2019-10-15 03:24:29,441 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 108) no Hoare annotation was computed. [2019-10-15 03:24:29,442 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 356) no Hoare annotation was computed. [2019-10-15 03:24:29,442 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 224) no Hoare annotation was computed. [2019-10-15 03:24:29,442 INFO L439 ceAbstractionStarter]: At program point L371(lines 13 390) the Hoare annotation is: false [2019-10-15 03:24:29,442 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 340) no Hoare annotation was computed. [2019-10-15 03:24:29,442 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 208) no Hoare annotation was computed. [2019-10-15 03:24:29,443 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 324) no Hoare annotation was computed. [2019-10-15 03:24:29,443 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 192) no Hoare annotation was computed. [2019-10-15 03:24:29,443 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2019-10-15 03:24:29,443 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2019-10-15 03:24:29,443 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-10-15 03:24:29,444 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2019-10-15 03:24:29,444 INFO L443 ceAbstractionStarter]: For program point L28(lines 28 43) no Hoare annotation was computed. [2019-10-15 03:24:29,444 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-10-15 03:24:29,444 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 390) the Hoare annotation is: true [2019-10-15 03:24:29,449 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 95) no Hoare annotation was computed. [2019-10-15 03:24:29,449 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 98) no Hoare annotation was computed. [2019-10-15 03:24:29,449 INFO L443 ceAbstractionStarter]: For program point L64(lines 64 79) no Hoare annotation was computed. [2019-10-15 03:24:29,450 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 63) no Hoare annotation was computed. [2019-10-15 03:24:29,450 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 179) no Hoare annotation was computed. [2019-10-15 03:24:29,450 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 163) no Hoare annotation was computed. [2019-10-15 03:24:29,450 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-10-15 03:24:29,450 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 279) no Hoare annotation was computed. [2019-10-15 03:24:29,450 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 147) no Hoare annotation was computed. [2019-10-15 03:24:29,450 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 182) no Hoare annotation was computed. [2019-10-15 03:24:29,450 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 77) no Hoare annotation was computed. [2019-10-15 03:24:29,451 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 263) no Hoare annotation was computed. [2019-10-15 03:24:29,451 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 131) no Hoare annotation was computed. [2019-10-15 03:24:29,451 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 61) no Hoare annotation was computed. [2019-10-15 03:24:29,451 INFO L443 ceAbstractionStarter]: For program point L364(lines 364 379) no Hoare annotation was computed. [2019-10-15 03:24:29,451 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 247) no Hoare annotation was computed. [2019-10-15 03:24:29,451 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 177) no Hoare annotation was computed. [2019-10-15 03:24:29,451 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 115) no Hoare annotation was computed. [2019-10-15 03:24:29,452 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2019-10-15 03:24:29,452 INFO L439 ceAbstractionStarter]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= main_~this_state~0 0))) (or (and .cse0 (= 2 main_~q~0)) (and (= 3 main_~q~0) (= 2 main_~this_state~0)) (and .cse0 (= main_~q~0 0)) (and (= main_~this_state~0 3) (<= 4 main_~q~0)))) [2019-10-15 03:24:29,452 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 363) no Hoare annotation was computed. [2019-10-15 03:24:29,452 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 231) no Hoare annotation was computed. [2019-10-15 03:24:29,453 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 282) no Hoare annotation was computed. [2019-10-15 03:24:29,453 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 161) no Hoare annotation was computed. [2019-10-15 03:24:29,453 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 347) no Hoare annotation was computed. [2019-10-15 03:24:29,454 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 277) no Hoare annotation was computed. [2019-10-15 03:24:29,454 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 215) no Hoare annotation was computed. [2019-10-15 03:24:29,454 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 145) no Hoare annotation was computed. [2019-10-15 03:24:29,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:24:29 BoogieIcfgContainer [2019-10-15 03:24:29,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:24:29,472 INFO L168 Benchmark]: Toolchain (without parser) took 2914.06 ms. Allocated memory was 138.9 MB in the beginning and 237.0 MB in the end (delta: 98.0 MB). Free memory was 102.5 MB in the beginning and 108.4 MB in the end (delta: -6.0 MB). Peak memory consumption was 92.1 MB. Max. memory is 7.1 GB. [2019-10-15 03:24:29,473 INFO L168 Benchmark]: CDTParser took 1.35 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 03:24:29,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.09 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.3 MB in the beginning and 181.5 MB in the end (delta: -79.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-10-15 03:24:29,475 INFO L168 Benchmark]: Boogie Preprocessor took 60.57 ms. Allocated memory is still 203.4 MB. Free memory was 181.5 MB in the beginning and 179.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-15 03:24:29,475 INFO L168 Benchmark]: RCFGBuilder took 602.06 ms. Allocated memory is still 203.4 MB. Free memory was 179.5 MB in the beginning and 150.9 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2019-10-15 03:24:29,476 INFO L168 Benchmark]: TraceAbstraction took 1808.23 ms. Allocated memory was 203.4 MB in the beginning and 237.0 MB in the end (delta: 33.6 MB). Free memory was 150.9 MB in the beginning and 108.4 MB in the end (delta: 42.5 MB). Peak memory consumption was 76.0 MB. Max. memory is 7.1 GB. [2019-10-15 03:24:29,481 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 438.09 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.3 MB in the beginning and 181.5 MB in the end (delta: -79.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.57 ms. Allocated memory is still 203.4 MB. Free memory was 181.5 MB in the beginning and 179.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 602.06 ms. Allocated memory is still 203.4 MB. Free memory was 179.5 MB in the beginning and 150.9 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1808.23 ms. Allocated memory was 203.4 MB in the beginning and 237.0 MB in the end (delta: 33.6 MB). Free memory was 150.9 MB in the beginning and 108.4 MB in the end (delta: 42.5 MB). Peak memory consumption was 76.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((this_state <= 0 && 2 == q) || (3 == q && 2 == this_state)) || (this_state <= 0 && q == 0)) || (this_state == 3 && 4 <= q) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (this_state <= 0 && q == 0) || (this_state == 3 && 4 <= q) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 1 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 997 SDtfs, 337 SDslu, 445 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 49 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 9913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...