/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label34.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:31:05,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:31:05,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:31:05,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:31:05,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:31:05,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:31:05,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:31:05,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:31:05,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:31:05,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:31:05,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:31:05,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:31:05,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:31:05,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:31:05,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:31:05,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:31:05,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:31:05,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:31:05,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:31:05,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:31:05,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:31:05,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:31:05,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:31:05,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:31:05,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:31:05,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:31:05,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:31:05,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:31:05,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:31:05,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:31:05,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:31:05,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:31:05,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:31:05,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:31:05,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:31:05,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:31:05,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:31:05,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:31:05,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:31:05,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:31:05,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:31:05,221 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:31:05,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:31:05,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:31:05,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:31:05,237 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:31:05,238 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:31:05,238 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:31:05,238 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:31:05,238 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:31:05,238 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:31:05,239 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:31:05,239 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:31:05,239 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:31:05,239 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:31:05,239 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:31:05,240 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:31:05,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:31:05,241 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:31:05,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:31:05,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:31:05,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:31:05,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:31:05,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:31:05,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:31:05,242 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:31:05,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:31:05,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:31:05,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:31:05,243 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:31:05,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:31:05,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:05,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:31:05,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:31:05,244 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:31:05,244 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:31:05,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:31:05,244 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:31:05,245 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:31:05,245 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:31:05,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:31:05,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:31:05,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:31:05,576 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:31:05,576 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:31:05,577 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label34.c [2019-11-23 23:31:05,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e418286e/61fd540b27c547cd8debd186d43c721e/FLAG9bc111674 [2019-11-23 23:31:06,207 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:31:06,208 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label34.c [2019-11-23 23:31:06,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e418286e/61fd540b27c547cd8debd186d43c721e/FLAG9bc111674 [2019-11-23 23:31:06,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e418286e/61fd540b27c547cd8debd186d43c721e [2019-11-23 23:31:06,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:31:06,527 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:31:06,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:06,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:31:06,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:31:06,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:06" (1/1) ... [2019-11-23 23:31:06,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1260a1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:06, skipping insertion in model container [2019-11-23 23:31:06,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:06" (1/1) ... [2019-11-23 23:31:06,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:31:06,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:31:07,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:07,136 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:31:07,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:07,264 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:31:07,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07 WrapperNode [2019-11-23 23:31:07,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:07,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:07,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:31:07,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:31:07,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07" (1/1) ... [2019-11-23 23:31:07,293 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07" (1/1) ... [2019-11-23 23:31:07,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:07,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:31:07,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:31:07,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:31:07,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07" (1/1) ... [2019-11-23 23:31:07,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07" (1/1) ... [2019-11-23 23:31:07,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07" (1/1) ... [2019-11-23 23:31:07,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07" (1/1) ... [2019-11-23 23:31:07,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07" (1/1) ... [2019-11-23 23:31:07,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07" (1/1) ... [2019-11-23 23:31:07,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07" (1/1) ... [2019-11-23 23:31:07,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:31:07,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:31:07,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:31:07,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:31:07,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07" (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-11-23 23:31:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:31:07,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:31:09,404 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:31:09,404 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:31:09,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:09 BoogieIcfgContainer [2019-11-23 23:31:09,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:31:09,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:31:09,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:31:09,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:31:09,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:06" (1/3) ... [2019-11-23 23:31:09,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18783ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:09, skipping insertion in model container [2019-11-23 23:31:09,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:07" (2/3) ... [2019-11-23 23:31:09,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18783ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:09, skipping insertion in model container [2019-11-23 23:31:09,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:09" (3/3) ... [2019-11-23 23:31:09,416 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label34.c [2019-11-23 23:31:09,426 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:31:09,435 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:31:09,448 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:31:09,480 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:31:09,481 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:31:09,481 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:31:09,481 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:31:09,482 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:31:09,482 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:31:09,482 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:31:09,482 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:31:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:31:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:31:09,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:09,514 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:09,515 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:09,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1323241247, now seen corresponding path program 1 times [2019-11-23 23:31:09,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:09,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391667657] [2019-11-23 23:31:09,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:10,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391667657] [2019-11-23 23:31:10,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:10,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:10,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897746894] [2019-11-23 23:31:10,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:10,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:10,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:10,065 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:31:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:10,826 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:31:10,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:10,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:31:10,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:10,843 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:31:10,843 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:31:10,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:31:10,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-23 23:31:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 23:31:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-11-23 23:31:10,912 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-11-23 23:31:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:10,913 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-11-23 23:31:10,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-11-23 23:31:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 23:31:10,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:10,925 INFO L410 BasicCegarLoop]: trace histogram [2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:10,925 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:10,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:10,925 INFO L82 PathProgramCache]: Analyzing trace with hash 585776473, now seen corresponding path program 1 times [2019-11-23 23:31:10,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:10,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918864799] [2019-11-23 23:31:10,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:10,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918864799] [2019-11-23 23:31:10,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:10,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:10,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311301697] [2019-11-23 23:31:10,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:10,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:10,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:10,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:10,985 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-11-23 23:31:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:11,407 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-11-23 23:31:11,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:11,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-23 23:31:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:11,417 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:31:11,417 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:31:11,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:31:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:31:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:31:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 706 transitions. [2019-11-23 23:31:11,453 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 706 transitions. Word has length 76 [2019-11-23 23:31:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:11,453 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 706 transitions. [2019-11-23 23:31:11,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2019-11-23 23:31:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 23:31:11,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:11,458 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:11,459 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:11,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1341148422, now seen corresponding path program 1 times [2019-11-23 23:31:11,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:11,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741573735] [2019-11-23 23:31:11,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 23:31:11,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741573735] [2019-11-23 23:31:11,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:11,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:11,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336503392] [2019-11-23 23:31:11,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:11,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:11,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:11,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:11,506 INFO L87 Difference]: Start difference. First operand 429 states and 706 transitions. Second operand 3 states. [2019-11-23 23:31:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:11,920 INFO L93 Difference]: Finished difference Result 1070 states and 1787 transitions. [2019-11-23 23:31:11,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:11,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 23:31:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:11,925 INFO L225 Difference]: With dead ends: 1070 [2019-11-23 23:31:11,925 INFO L226 Difference]: Without dead ends: 642 [2019-11-23 23:31:11,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-23 23:31:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-23 23:31:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 429. [2019-11-23 23:31:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:31:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 706 transitions. [2019-11-23 23:31:11,951 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 706 transitions. Word has length 83 [2019-11-23 23:31:11,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:11,951 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 706 transitions. [2019-11-23 23:31:11,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2019-11-23 23:31:11,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-23 23:31:11,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:11,955 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:11,955 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:11,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1986461696, now seen corresponding path program 1 times [2019-11-23 23:31:11,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:11,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038932990] [2019-11-23 23:31:11,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:12,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038932990] [2019-11-23 23:31:12,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:12,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:12,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83680591] [2019-11-23 23:31:12,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:12,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:12,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:12,045 INFO L87 Difference]: Start difference. First operand 429 states and 706 transitions. Second operand 4 states. [2019-11-23 23:31:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:12,540 INFO L93 Difference]: Finished difference Result 939 states and 1517 transitions. [2019-11-23 23:31:12,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:12,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-23 23:31:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:12,543 INFO L225 Difference]: With dead ends: 939 [2019-11-23 23:31:12,544 INFO L226 Difference]: Without dead ends: 511 [2019-11-23 23:31:12,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-11-23 23:31:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 500. [2019-11-23 23:31:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-23 23:31:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 783 transitions. [2019-11-23 23:31:12,562 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 783 transitions. Word has length 86 [2019-11-23 23:31:12,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:12,563 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 783 transitions. [2019-11-23 23:31:12,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 783 transitions. [2019-11-23 23:31:12,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-23 23:31:12,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:12,566 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:12,566 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:12,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:12,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1981857080, now seen corresponding path program 1 times [2019-11-23 23:31:12,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:12,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128425356] [2019-11-23 23:31:12,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:12,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128425356] [2019-11-23 23:31:12,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:12,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:12,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502929472] [2019-11-23 23:31:12,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:12,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:12,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:12,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:12,663 INFO L87 Difference]: Start difference. First operand 500 states and 783 transitions. Second operand 4 states. [2019-11-23 23:31:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:13,337 INFO L93 Difference]: Finished difference Result 1212 states and 1947 transitions. [2019-11-23 23:31:13,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:13,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-23 23:31:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:13,343 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:31:13,344 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:31:13,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:31:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2019-11-23 23:31:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1157 transitions. [2019-11-23 23:31:13,381 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1157 transitions. Word has length 90 [2019-11-23 23:31:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:13,382 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1157 transitions. [2019-11-23 23:31:13,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1157 transitions. [2019-11-23 23:31:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:31:13,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:13,384 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:13,385 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:13,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1728898195, now seen corresponding path program 1 times [2019-11-23 23:31:13,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:13,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291836670] [2019-11-23 23:31:13,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:13,453 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:13,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291836670] [2019-11-23 23:31:13,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:13,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:13,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629085912] [2019-11-23 23:31:13,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:13,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:13,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:13,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:13,457 INFO L87 Difference]: Start difference. First operand 784 states and 1157 transitions. Second operand 3 states. [2019-11-23 23:31:13,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:13,806 INFO L93 Difference]: Finished difference Result 1709 states and 2539 transitions. [2019-11-23 23:31:13,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:13,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-23 23:31:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:13,812 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:31:13,812 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:31:13,814 INFO L630 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-11-23 23:31:13,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:31:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 784. [2019-11-23 23:31:13,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1014 transitions. [2019-11-23 23:31:13,846 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1014 transitions. Word has length 93 [2019-11-23 23:31:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:13,846 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1014 transitions. [2019-11-23 23:31:13,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1014 transitions. [2019-11-23 23:31:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 23:31:13,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:13,851 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:13,851 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:13,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1603153473, now seen corresponding path program 1 times [2019-11-23 23:31:13,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:13,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690477108] [2019-11-23 23:31:13,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:31:13,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690477108] [2019-11-23 23:31:13,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:13,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:13,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41866502] [2019-11-23 23:31:13,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:13,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:13,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:13,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:13,945 INFO L87 Difference]: Start difference. First operand 784 states and 1014 transitions. Second operand 4 states. [2019-11-23 23:31:14,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:14,539 INFO L93 Difference]: Finished difference Result 2064 states and 2702 transitions. [2019-11-23 23:31:14,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:14,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-23 23:31:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:14,546 INFO L225 Difference]: With dead ends: 2064 [2019-11-23 23:31:14,546 INFO L226 Difference]: Without dead ends: 1281 [2019-11-23 23:31:14,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:14,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-23 23:31:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 713. [2019-11-23 23:31:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:31:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 919 transitions. [2019-11-23 23:31:14,570 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 919 transitions. Word has length 101 [2019-11-23 23:31:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:14,570 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 919 transitions. [2019-11-23 23:31:14,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 919 transitions. [2019-11-23 23:31:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-23 23:31:14,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:14,573 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:14,573 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:14,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2105517815, now seen corresponding path program 1 times [2019-11-23 23:31:14,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:14,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266420317] [2019-11-23 23:31:14,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:14,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266420317] [2019-11-23 23:31:14,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:14,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:14,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158293445] [2019-11-23 23:31:14,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:14,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:14,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:14,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:14,666 INFO L87 Difference]: Start difference. First operand 713 states and 919 transitions. Second operand 3 states. [2019-11-23 23:31:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:14,958 INFO L93 Difference]: Finished difference Result 784 states and 994 transitions. [2019-11-23 23:31:14,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:14,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-23 23:31:14,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:14,960 INFO L225 Difference]: With dead ends: 784 [2019-11-23 23:31:14,960 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:31:14,961 INFO L630 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-11-23 23:31:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:31:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:31:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:31:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:31:14,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2019-11-23 23:31:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:14,962 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:31:14,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:31:14,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:31:14,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:31:15,205 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:31:15,206 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:31:15,206 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:31:15,206 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:31:15,206 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:31:15,206 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:31:15,207 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:31:15,207 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:31:15,207 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:31:15,207 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:31:15,207 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:31:15,207 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:31:15,207 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:31:15,207 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:31:15,207 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:31:15,207 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:31:15,208 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:31:15,208 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= 1 ~a7~0)) (.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= 13 ~a8~0)) (and (not .cse1) .cse0))) [2019-11-23 23:31:15,208 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:31:15,208 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:31:15,208 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:31:15,208 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:31:15,208 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:31:15,209 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:31:15,209 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:31:15,209 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:31:15,209 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:31:15,209 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:31:15,209 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:31:15,209 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:31:15,209 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:31:15,210 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:31:15,210 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:31:15,210 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:31:15,210 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:31:15,210 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:31:15,210 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:31:15,210 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:31:15,210 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:31:15,211 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:31:15,211 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:31:15,211 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= 1 ~a7~0)) (.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= 13 ~a8~0)) (and (not .cse1) .cse0))) [2019-11-23 23:31:15,211 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:31:15,211 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:31:15,211 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:31:15,212 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:15,212 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:31:15,212 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:31:15,212 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:31:15,212 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:31:15,212 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:31:15,213 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:31:15,213 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:31:15,213 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:31:15,213 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:15,213 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:31:15,213 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:31:15,213 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 23:31:15,214 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:31:15,214 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:31:15,214 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:31:15,214 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:31:15,214 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:31:15,215 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:31:15,215 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:31:15,215 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:31:15,215 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:31:15,215 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:31:15,215 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 491) no Hoare annotation was computed. [2019-11-23 23:31:15,216 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:31:15,216 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:31:15,216 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:31:15,216 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:31:15,216 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:31:15,216 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:31:15,216 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:31:15,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:15 BoogieIcfgContainer [2019-11-23 23:31:15,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:31:15,238 INFO L168 Benchmark]: Toolchain (without parser) took 8710.77 ms. Allocated memory was 137.9 MB in the beginning and 338.7 MB in the end (delta: 200.8 MB). Free memory was 99.8 MB in the beginning and 88.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 212.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:15,239 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 23:31:15,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 736.96 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 164.3 MB in the end (delta: -64.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:15,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.46 ms. Allocated memory is still 202.4 MB. Free memory was 164.3 MB in the beginning and 157.9 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:15,242 INFO L168 Benchmark]: Boogie Preprocessor took 118.56 ms. Allocated memory is still 202.4 MB. Free memory was 157.9 MB in the beginning and 153.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:15,243 INFO L168 Benchmark]: RCFGBuilder took 1927.36 ms. Allocated memory was 202.4 MB in the beginning and 252.2 MB in the end (delta: 49.8 MB). Free memory was 153.7 MB in the beginning and 205.1 MB in the end (delta: -51.4 MB). Peak memory consumption was 110.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:15,244 INFO L168 Benchmark]: TraceAbstraction took 5827.79 ms. Allocated memory was 252.2 MB in the beginning and 338.7 MB in the end (delta: 86.5 MB). Free memory was 205.1 MB in the beginning and 88.4 MB in the end (delta: 116.7 MB). Peak memory consumption was 203.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:15,249 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 736.96 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 164.3 MB in the end (delta: -64.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 94.46 ms. Allocated memory is still 202.4 MB. Free memory was 164.3 MB in the beginning and 157.9 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.56 ms. Allocated memory is still 202.4 MB. Free memory was 157.9 MB in the beginning and 153.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1927.36 ms. Allocated memory was 202.4 MB in the beginning and 252.2 MB in the end (delta: 49.8 MB). Free memory was 153.7 MB in the beginning and 205.1 MB in the end (delta: -51.4 MB). Peak memory consumption was 110.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5827.79 ms. Allocated memory was 252.2 MB in the beginning and 338.7 MB in the end (delta: 86.5 MB). Free memory was 205.1 MB in the beginning and 88.4 MB in the end (delta: 116.7 MB). Peak memory consumption was 203.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 491]: 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: 30]: Loop Invariant Derived loop invariant: ((!(a16 == 6) && a21 == 1) || (1 == a7 && 13 == a8)) || (!(1 == a7) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((!(a16 == 6) && a21 == 1) || (1 == a7 && 13 == a8)) || (!(1 == a7) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 5.7s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 478 SDtfs, 855 SDslu, 59 SDs, 0 SdLazy, 2385 SolverSat, 560 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=784occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 934 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 32 NumberOfFragments, 49 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3708 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 204 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 700 ConstructedInterpolants, 0 QuantifiedInterpolants, 137351 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 166/166 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...