/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:51:36,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:51:36,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:51:36,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:51:36,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:51:36,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:51:36,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:51:36,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:51:36,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:51:36,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:51:36,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:51:36,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:51:36,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:51:36,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:51:36,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:51:36,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:51:36,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:51:36,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:51:36,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:51:36,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:51:36,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:51:36,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:51:36,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:51:36,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:51:36,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:51:36,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:51:36,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:51:36,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:51:36,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:51:36,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:51:36,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:51:36,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:51:36,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:51:36,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:51:36,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:51:36,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:51:36,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:51:36,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:51:36,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:51:36,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:51:36,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:51:36,451 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-11-23 20:51:36,464 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:51:36,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:51:36,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:51:36,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:51:36,466 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:51:36,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:51:36,466 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:51:36,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:51:36,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:51:36,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:51:36,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:51:36,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:51:36,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:51:36,468 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:51:36,468 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:51:36,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:51:36,468 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:51:36,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:51:36,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:51:36,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:51:36,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:51:36,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:51:36,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:51:36,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:51:36,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:51:36,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:51:36,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:51:36,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:51:36,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:51:36,471 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:51:36,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:51:36,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:51:36,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:51:36,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:51:36,766 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:51:36,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label10.c [2019-11-23 20:51:36,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b14f0295/37c3e68662c241558cce77f4e1e8d8b2/FLAGf2da809ae [2019-11-23 20:51:37,396 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:51:37,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label10.c [2019-11-23 20:51:37,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b14f0295/37c3e68662c241558cce77f4e1e8d8b2/FLAGf2da809ae [2019-11-23 20:51:37,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b14f0295/37c3e68662c241558cce77f4e1e8d8b2 [2019-11-23 20:51:37,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:51:37,692 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:51:37,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:51:37,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:51:37,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:51:37,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:51:37" (1/1) ... [2019-11-23 20:51:37,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef52c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:37, skipping insertion in model container [2019-11-23 20:51:37,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:51:37" (1/1) ... [2019-11-23 20:51:37,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:51:37,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:51:38,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:51:38,432 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:51:38,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:51:38,540 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:51:38,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:38 WrapperNode [2019-11-23 20:51:38,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:51:38,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:51:38,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:51:38,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:51:38,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:38" (1/1) ... [2019-11-23 20:51:38,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:38" (1/1) ... [2019-11-23 20:51:38,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:51:38,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:51:38,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:51:38,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:51:38,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:38" (1/1) ... [2019-11-23 20:51:38,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:38" (1/1) ... [2019-11-23 20:51:38,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:38" (1/1) ... [2019-11-23 20:51:38,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:38" (1/1) ... [2019-11-23 20:51:38,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:38" (1/1) ... [2019-11-23 20:51:38,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:38" (1/1) ... [2019-11-23 20:51:38,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:38" (1/1) ... [2019-11-23 20:51:38,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:51:38,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:51:38,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:51:38,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:51:38,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:38" (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 20:51:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:51:38,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:51:39,975 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:51:39,976 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:51:39,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:51:39 BoogieIcfgContainer [2019-11-23 20:51:39,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:51:39,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:51:39,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:51:39,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:51:39,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:51:37" (1/3) ... [2019-11-23 20:51:39,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730fd236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:51:39, skipping insertion in model container [2019-11-23 20:51:39,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:38" (2/3) ... [2019-11-23 20:51:39,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730fd236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:51:39, skipping insertion in model container [2019-11-23 20:51:39,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:51:39" (3/3) ... [2019-11-23 20:51:39,988 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label10.c [2019-11-23 20:51:39,998 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:51:40,005 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:51:40,017 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:51:40,056 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:51:40,056 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:51:40,057 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:51:40,057 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:51:40,057 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:51:40,058 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:51:40,058 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:51:40,058 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:51:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:51:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-23 20:51:40,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:40,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:40,109 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:40,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:40,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1265250489, now seen corresponding path program 1 times [2019-11-23 20:51:40,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:40,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122736458] [2019-11-23 20:51:40,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:40,572 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 20:51:40,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122736458] [2019-11-23 20:51:40,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:40,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:40,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449949045] [2019-11-23 20:51:40,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:40,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:40,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:40,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:40,599 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-23 20:51:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:41,944 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-23 20:51:41,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:41,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-23 20:51:41,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:41,965 INFO L225 Difference]: With dead ends: 662 [2019-11-23 20:51:41,966 INFO L226 Difference]: Without dead ends: 397 [2019-11-23 20:51:41,970 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 20:51:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-23 20:51:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-23 20:51:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-23 20:51:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-11-23 20:51:42,041 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 110 [2019-11-23 20:51:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:42,041 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-11-23 20:51:42,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-11-23 20:51:42,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-23 20:51:42,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:42,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:42,046 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:42,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:42,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1518740255, now seen corresponding path program 1 times [2019-11-23 20:51:42,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:42,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772551391] [2019-11-23 20:51:42,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:42,098 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 20:51:42,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772551391] [2019-11-23 20:51:42,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:42,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:42,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117864244] [2019-11-23 20:51:42,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:42,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:42,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:42,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:42,102 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-11-23 20:51:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:42,707 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-11-23 20:51:42,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:42,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-23 20:51:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:42,713 INFO L225 Difference]: With dead ends: 1185 [2019-11-23 20:51:42,713 INFO L226 Difference]: Without dead ends: 790 [2019-11-23 20:51:42,716 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 20:51:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-23 20:51:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-23 20:51:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-23 20:51:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-11-23 20:51:42,783 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 115 [2019-11-23 20:51:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:42,784 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-11-23 20:51:42,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-11-23 20:51:42,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-23 20:51:42,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:42,794 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:42,798 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:42,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:42,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1261995703, now seen corresponding path program 1 times [2019-11-23 20:51:42,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:42,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175587523] [2019-11-23 20:51:42,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:51:42,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175587523] [2019-11-23 20:51:42,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:42,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:42,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540755669] [2019-11-23 20:51:42,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:42,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:42,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:42,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:42,914 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-11-23 20:51:43,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:43,477 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2019-11-23 20:51:43,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:43,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-23 20:51:43,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:43,484 INFO L225 Difference]: With dead ends: 1971 [2019-11-23 20:51:43,484 INFO L226 Difference]: Without dead ends: 1183 [2019-11-23 20:51:43,486 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 20:51:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-23 20:51:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2019-11-23 20:51:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-23 20:51:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-11-23 20:51:43,531 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 136 [2019-11-23 20:51:43,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:43,534 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-11-23 20:51:43,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-11-23 20:51:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-23 20:51:43,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:43,550 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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 20:51:43,550 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:43,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1869093076, now seen corresponding path program 1 times [2019-11-23 20:51:43,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:43,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653525290] [2019-11-23 20:51:43,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-23 20:51:43,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653525290] [2019-11-23 20:51:43,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:43,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:43,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407603386] [2019-11-23 20:51:43,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:43,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:43,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:43,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:43,746 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-11-23 20:51:44,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:44,285 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-11-23 20:51:44,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:44,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-23 20:51:44,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:44,293 INFO L225 Difference]: With dead ends: 2233 [2019-11-23 20:51:44,293 INFO L226 Difference]: Without dead ends: 1314 [2019-11-23 20:51:44,295 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 20:51:44,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-23 20:51:44,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1052. [2019-11-23 20:51:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-23 20:51:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1370 transitions. [2019-11-23 20:51:44,321 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1370 transitions. Word has length 172 [2019-11-23 20:51:44,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:44,322 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1370 transitions. [2019-11-23 20:51:44,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1370 transitions. [2019-11-23 20:51:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-23 20:51:44,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:44,326 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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 20:51:44,326 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:44,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:44,327 INFO L82 PathProgramCache]: Analyzing trace with hash 378795968, now seen corresponding path program 1 times [2019-11-23 20:51:44,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:44,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20593358] [2019-11-23 20:51:44,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 20:51:44,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20593358] [2019-11-23 20:51:44,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:44,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:44,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786206958] [2019-11-23 20:51:44,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:44,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:44,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:44,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:44,444 INFO L87 Difference]: Start difference. First operand 1052 states and 1370 transitions. Second operand 4 states. [2019-11-23 20:51:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:45,138 INFO L93 Difference]: Finished difference Result 2238 states and 2892 transitions. [2019-11-23 20:51:45,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:51:45,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-23 20:51:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:45,144 INFO L225 Difference]: With dead ends: 2238 [2019-11-23 20:51:45,145 INFO L226 Difference]: Without dead ends: 1188 [2019-11-23 20:51:45,147 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 20:51:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2019-11-23 20:51:45,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1183. [2019-11-23 20:51:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-23 20:51:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1507 transitions. [2019-11-23 20:51:45,173 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1507 transitions. Word has length 180 [2019-11-23 20:51:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:45,174 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1507 transitions. [2019-11-23 20:51:45,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1507 transitions. [2019-11-23 20:51:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-23 20:51:45,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:45,179 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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 20:51:45,179 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1391763960, now seen corresponding path program 1 times [2019-11-23 20:51:45,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:45,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160210425] [2019-11-23 20:51:45,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 20:51:45,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160210425] [2019-11-23 20:51:45,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:45,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:45,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551748572] [2019-11-23 20:51:45,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:51:45,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:45,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:51:45,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:51:45,281 INFO L87 Difference]: Start difference. First operand 1183 states and 1507 transitions. Second operand 5 states. [2019-11-23 20:51:46,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:46,344 INFO L93 Difference]: Finished difference Result 2495 states and 3215 transitions. [2019-11-23 20:51:46,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:51:46,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2019-11-23 20:51:46,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:46,352 INFO L225 Difference]: With dead ends: 2495 [2019-11-23 20:51:46,353 INFO L226 Difference]: Without dead ends: 1445 [2019-11-23 20:51:46,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:51:46,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-23 20:51:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-23 20:51:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:51:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1799 transitions. [2019-11-23 20:51:46,383 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1799 transitions. Word has length 184 [2019-11-23 20:51:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:46,383 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1799 transitions. [2019-11-23 20:51:46,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:51:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1799 transitions. [2019-11-23 20:51:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-23 20:51:46,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:46,388 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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 20:51:46,389 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:46,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:46,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1949803731, now seen corresponding path program 1 times [2019-11-23 20:51:46,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:46,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484732829] [2019-11-23 20:51:46,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 20:51:46,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484732829] [2019-11-23 20:51:46,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:46,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:46,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901388441] [2019-11-23 20:51:46,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:46,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:46,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:46,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:46,469 INFO L87 Difference]: Start difference. First operand 1445 states and 1799 transitions. Second operand 3 states. [2019-11-23 20:51:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:46,955 INFO L93 Difference]: Finished difference Result 3150 states and 3936 transitions. [2019-11-23 20:51:46,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:46,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-23 20:51:46,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:46,962 INFO L225 Difference]: With dead ends: 3150 [2019-11-23 20:51:46,962 INFO L226 Difference]: Without dead ends: 1576 [2019-11-23 20:51:46,964 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 20:51:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-23 20:51:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2019-11-23 20:51:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:51:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1592 transitions. [2019-11-23 20:51:47,014 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1592 transitions. Word has length 187 [2019-11-23 20:51:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:47,014 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1592 transitions. [2019-11-23 20:51:47,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:47,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1592 transitions. [2019-11-23 20:51:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-23 20:51:47,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:47,019 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:47,020 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:47,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash -87166121, now seen corresponding path program 1 times [2019-11-23 20:51:47,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:47,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762302628] [2019-11-23 20:51:47,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-23 20:51:47,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762302628] [2019-11-23 20:51:47,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:47,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:47,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250280913] [2019-11-23 20:51:47,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:47,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:47,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:47,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:47,129 INFO L87 Difference]: Start difference. First operand 1445 states and 1592 transitions. Second operand 3 states. [2019-11-23 20:51:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:47,565 INFO L93 Difference]: Finished difference Result 3412 states and 3789 transitions. [2019-11-23 20:51:47,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:47,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-11-23 20:51:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:47,574 INFO L225 Difference]: With dead ends: 3412 [2019-11-23 20:51:47,574 INFO L226 Difference]: Without dead ends: 2100 [2019-11-23 20:51:47,577 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 20:51:47,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-23 20:51:47,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1707. [2019-11-23 20:51:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-23 20:51:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1869 transitions. [2019-11-23 20:51:47,609 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1869 transitions. Word has length 202 [2019-11-23 20:51:47,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:47,609 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1869 transitions. [2019-11-23 20:51:47,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1869 transitions. [2019-11-23 20:51:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-23 20:51:47,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:47,614 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:47,615 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:47,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:47,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1247188405, now seen corresponding path program 1 times [2019-11-23 20:51:47,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:47,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025298709] [2019-11-23 20:51:47,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 20:51:47,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025298709] [2019-11-23 20:51:47,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643099966] [2019-11-23 20:51:47,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:48,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:51:48,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:51:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-23 20:51:48,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:51:48,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:51:48,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457316950] [2019-11-23 20:51:48,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:48,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:48,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:48,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:51:48,268 INFO L87 Difference]: Start difference. First operand 1707 states and 1869 transitions. Second operand 3 states. [2019-11-23 20:51:48,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:48,695 INFO L93 Difference]: Finished difference Result 1707 states and 1869 transitions. [2019-11-23 20:51:48,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:48,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-11-23 20:51:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:48,696 INFO L225 Difference]: With dead ends: 1707 [2019-11-23 20:51:48,697 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:51:48,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:51:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:51:48,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:51:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:51:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:51:48,699 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 231 [2019-11-23 20:51:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:48,700 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:51:48,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:51:48,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:51:48,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:48,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:51:49,127 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:51:49,128 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:51:49,128 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,128 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,128 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,128 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,128 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,129 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,129 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:51:49,129 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:51:49,129 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:51:49,129 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:51:49,129 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:51:49,129 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:51:49,129 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:51:49,130 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:51:49,130 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:51:49,130 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:51:49,130 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,130 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,130 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,130 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,130 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,130 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,130 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:51:49,130 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:51:49,131 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:51:49,131 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:51:49,131 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:51:49,131 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:51:49,131 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:51:49,131 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:51:49,131 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:51:49,131 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:51:49,132 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:51:49,132 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:51:49,132 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:51:49,132 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:51:49,132 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:51:49,132 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,132 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,132 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,132 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,132 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,133 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:51:49,133 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:51:49,133 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:51:49,133 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:51:49,133 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:51:49,133 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:51:49,133 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:51:49,133 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:51:49,133 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:51:49,134 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (and (= ~a17~0 1) .cse0) (and (= 1 ~a7~0) (<= ~a21~0 0)))) [2019-11-23 20:51:49,134 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,134 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,134 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,134 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,134 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,134 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:51:49,134 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:51:49,135 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:51:49,135 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:51:49,135 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:51:49,135 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:51:49,135 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:51:49,135 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:51:49,135 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:51:49,135 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:51:49,135 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:51:49,135 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:51:49,135 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:51:49,135 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:51:49,135 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,135 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,136 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:51:49,137 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:51:49,138 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:51:49,138 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:51:49,138 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:51:49,138 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:51:49,138 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,138 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (and (= ~a17~0 1) .cse0) (and (= 1 ~a7~0) (<= ~a21~0 0)))) [2019-11-23 20:51:49,138 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,138 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,138 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,138 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,139 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:51:49,139 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:51:49,139 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:51:49,139 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:51:49,139 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:51:49,139 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:51:49,139 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:51:49,139 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:51:49,140 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,141 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,141 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,141 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,141 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,141 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:51:49,141 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:51:49,141 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:51:49,141 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:51:49,142 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:51:49,142 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:51:49,142 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:51:49,142 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:51:49,142 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:51:49,142 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:51:49,142 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:51:49,142 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:51:49,142 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:51:49,142 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,143 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,143 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,143 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,143 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:51:49,143 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,143 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,143 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:51:49,143 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:51:49,143 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:51:49,144 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:51:49,144 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:51:49,144 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:51:49,144 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:51:49,144 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:51:49,144 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:51:49,144 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:51:49,144 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:51:49,144 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:51:49,144 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:51:49,144 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:51:49,145 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 506) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,146 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:49,147 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:51:49,147 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:51:49,147 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:51:49,147 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:51:49,147 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:51:49,147 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:51:49,147 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:51:49,147 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:51:49,147 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:51:49,147 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:51:49,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:51:49 BoogieIcfgContainer [2019-11-23 20:51:49,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:51:49,173 INFO L168 Benchmark]: Toolchain (without parser) took 11480.56 ms. Allocated memory was 137.9 MB in the beginning and 394.3 MB in the end (delta: 256.4 MB). Free memory was 101.2 MB in the beginning and 140.8 MB in the end (delta: -39.6 MB). Peak memory consumption was 216.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:49,174 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 20:51:49,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.26 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 164.5 MB in the end (delta: -63.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:49,175 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.21 ms. Allocated memory is still 202.4 MB. Free memory was 163.8 MB in the beginning and 158.2 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:49,179 INFO L168 Benchmark]: Boogie Preprocessor took 64.91 ms. Allocated memory is still 202.4 MB. Free memory was 158.2 MB in the beginning and 153.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:49,180 INFO L168 Benchmark]: RCFGBuilder took 1272.79 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 153.9 MB in the beginning and 163.2 MB in the end (delta: -9.2 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:49,180 INFO L168 Benchmark]: TraceAbstraction took 9189.65 ms. Allocated memory was 234.4 MB in the beginning and 394.3 MB in the end (delta: 159.9 MB). Free memory was 161.7 MB in the beginning and 140.8 MB in the end (delta: 20.9 MB). Peak memory consumption was 180.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:49,192 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.48 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 848.26 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 164.5 MB in the end (delta: -63.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 98.21 ms. Allocated memory is still 202.4 MB. Free memory was 163.8 MB in the beginning and 158.2 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.91 ms. Allocated memory is still 202.4 MB. Free memory was 158.2 MB in the beginning and 153.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1272.79 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 153.9 MB in the beginning and 163.2 MB in the end (delta: -9.2 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9189.65 ms. Allocated memory was 234.4 MB in the beginning and 394.3 MB in the end (delta: 159.9 MB). Free memory was 161.7 MB in the beginning and 140.8 MB in the end (delta: 20.9 MB). Peak memory consumption was 180.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 506]: 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) || (a21 == 1 && 15 == a8)) || (a17 == 1 && a21 == 1)) || (1 == a7 && a21 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || (a21 == 1 && 15 == a8)) || (a17 == 1 && a21 == 1)) || (1 == a7 && a21 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 9.0s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 724 SDtfs, 1756 SDslu, 87 SDs, 0 SdLazy, 4163 SolverSat, 643 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 36 NumberOfFragments, 61 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1565 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 210 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1748 NumberOfCodeBlocks, 1748 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1738 ConstructedInterpolants, 0 QuantifiedInterpolants, 651070 SizeOfPredicates, 1 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1401/1428 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...