java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label06.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:41:58,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:41:58,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:41:58,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:41:58,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:41:58,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:41:58,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:41:58,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:41:58,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:41:58,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:41:58,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:41:58,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:41:58,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:41:58,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:41:58,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:41:58,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:41:58,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:41:58,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:41:58,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:41:58,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:41:58,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:41:58,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:41:58,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:41:58,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:41:58,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:41:58,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:41:58,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:41:58,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:41:58,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:41:58,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:41:58,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:41:58,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:41:58,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:41:58,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:41:58,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:41:58,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:41:58,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:41:58,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:41:58,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:41:58,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:41:58,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:41:58,460 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 00:41:58,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:41:58,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:41:58,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:41:58,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:41:58,476 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:41:58,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:41:58,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:41:58,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:41:58,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:41:58,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:41:58,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:41:58,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:41:58,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:41:58,477 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:41:58,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:41:58,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:41:58,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:41:58,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:41:58,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:41:58,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:41:58,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:41:58,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:41:58,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:41:58,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:41:58,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:41:58,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:41:58,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:41:58,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:41:58,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:41:58,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:41:58,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:41:58,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:41:58,524 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:41:58,524 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:41:58,525 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label06.c [2019-10-02 00:41:58,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e03290d3/92604cc799004f8faefe99b8aad1cf7b/FLAGe56ff1ee8 [2019-10-02 00:41:59,123 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:41:59,124 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label06.c [2019-10-02 00:41:59,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e03290d3/92604cc799004f8faefe99b8aad1cf7b/FLAGe56ff1ee8 [2019-10-02 00:41:59,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e03290d3/92604cc799004f8faefe99b8aad1cf7b [2019-10-02 00:41:59,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:41:59,405 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:41:59,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:41:59,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:41:59,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:41:59,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:41:59" (1/1) ... [2019-10-02 00:41:59,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710022fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:41:59, skipping insertion in model container [2019-10-02 00:41:59,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:41:59" (1/1) ... [2019-10-02 00:41:59,421 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:41:59,482 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:41:59,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:41:59,990 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:42:00,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:42:00,100 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:42:00,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:00 WrapperNode [2019-10-02 00:42:00,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:42:00,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:42:00,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:42:00,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:42:00,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:00" (1/1) ... [2019-10-02 00:42:00,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:00" (1/1) ... [2019-10-02 00:42:00,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:00" (1/1) ... [2019-10-02 00:42:00,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:00" (1/1) ... [2019-10-02 00:42:00,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:00" (1/1) ... [2019-10-02 00:42:00,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:00" (1/1) ... [2019-10-02 00:42:00,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:00" (1/1) ... [2019-10-02 00:42:00,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:42:00,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:42:00,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:42:00,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:42:00,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:42:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:42:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:42:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 00:42:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:42:00,299 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 00:42:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:42:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:42:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 00:42:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:42:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:42:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:42:01,470 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:42:01,471 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 00:42:01,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:42:01 BoogieIcfgContainer [2019-10-02 00:42:01,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:42:01,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:42:01,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:42:01,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:42:01,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:41:59" (1/3) ... [2019-10-02 00:42:01,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fad9418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:42:01, skipping insertion in model container [2019-10-02 00:42:01,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:00" (2/3) ... [2019-10-02 00:42:01,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fad9418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:42:01, skipping insertion in model container [2019-10-02 00:42:01,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:42:01" (3/3) ... [2019-10-02 00:42:01,481 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label06.c [2019-10-02 00:42:01,490 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:42:01,498 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:42:01,515 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:42:01,547 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:42:01,548 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:42:01,548 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:42:01,548 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:42:01,548 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:42:01,549 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:42:01,549 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:42:01,549 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:42:01,549 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:42:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2019-10-02 00:42:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 00:42:01,586 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:01,587 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:01,589 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:01,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:01,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1251834154, now seen corresponding path program 1 times [2019-10-02 00:42:01,596 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:01,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:01,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:01,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:01,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:42:02,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:42:02,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:42:02,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:42:02,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:42:02,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:42:02,150 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2019-10-02 00:42:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:02,983 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2019-10-02 00:42:02,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:42:02,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-10-02 00:42:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:03,011 INFO L225 Difference]: With dead ends: 547 [2019-10-02 00:42:03,012 INFO L226 Difference]: Without dead ends: 278 [2019-10-02 00:42:03,021 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:42:03,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-02 00:42:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-10-02 00:42:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-02 00:42:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 394 transitions. [2019-10-02 00:42:03,132 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 394 transitions. Word has length 130 [2019-10-02 00:42:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:03,136 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 394 transitions. [2019-10-02 00:42:03,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:42:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 394 transitions. [2019-10-02 00:42:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 00:42:03,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:03,150 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:03,151 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:03,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:03,152 INFO L82 PathProgramCache]: Analyzing trace with hash -932424019, now seen corresponding path program 1 times [2019-10-02 00:42:03,152 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:03,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:03,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:42:03,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:42:03,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:42:03,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:42:03,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:42:03,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:42:03,328 INFO L87 Difference]: Start difference. First operand 278 states and 394 transitions. Second operand 6 states. [2019-10-02 00:42:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:04,064 INFO L93 Difference]: Finished difference Result 840 states and 1222 transitions. [2019-10-02 00:42:04,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:42:04,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-10-02 00:42:04,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:04,075 INFO L225 Difference]: With dead ends: 840 [2019-10-02 00:42:04,076 INFO L226 Difference]: Without dead ends: 568 [2019-10-02 00:42:04,077 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:42:04,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-02 00:42:04,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 556. [2019-10-02 00:42:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-10-02 00:42:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 785 transitions. [2019-10-02 00:42:04,123 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 785 transitions. Word has length 140 [2019-10-02 00:42:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:04,123 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 785 transitions. [2019-10-02 00:42:04,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:42:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 785 transitions. [2019-10-02 00:42:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 00:42:04,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:04,126 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:04,127 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:04,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:04,127 INFO L82 PathProgramCache]: Analyzing trace with hash -188990609, now seen corresponding path program 1 times [2019-10-02 00:42:04,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:04,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:04,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:04,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:04,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:42:04,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:42:04,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:42:04,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:42:04,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:42:04,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:42:04,481 INFO L87 Difference]: Start difference. First operand 556 states and 785 transitions. Second operand 5 states. [2019-10-02 00:42:05,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:05,144 INFO L93 Difference]: Finished difference Result 1205 states and 1730 transitions. [2019-10-02 00:42:05,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:42:05,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-02 00:42:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:05,154 INFO L225 Difference]: With dead ends: 1205 [2019-10-02 00:42:05,154 INFO L226 Difference]: Without dead ends: 554 [2019-10-02 00:42:05,156 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-10-02 00:42:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-02 00:42:05,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2019-10-02 00:42:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-02 00:42:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 712 transitions. [2019-10-02 00:42:05,181 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 712 transitions. Word has length 141 [2019-10-02 00:42:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:05,181 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 712 transitions. [2019-10-02 00:42:05,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:42:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 712 transitions. [2019-10-02 00:42:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 00:42:05,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:05,185 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:05,185 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:05,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:05,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1244428519, now seen corresponding path program 1 times [2019-10-02 00:42:05,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:05,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:05,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:05,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:05,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:42:05,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:42:05,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:42:05,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:42:05,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:42:05,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:42:05,357 INFO L87 Difference]: Start difference. First operand 554 states and 712 transitions. Second operand 3 states. [2019-10-02 00:42:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:05,848 INFO L93 Difference]: Finished difference Result 1509 states and 1963 transitions. [2019-10-02 00:42:05,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:42:05,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-10-02 00:42:05,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:05,857 INFO L225 Difference]: With dead ends: 1509 [2019-10-02 00:42:05,857 INFO L226 Difference]: Without dead ends: 961 [2019-10-02 00:42:05,859 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:42:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-10-02 00:42:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2019-10-02 00:42:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-10-02 00:42:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1189 transitions. [2019-10-02 00:42:05,893 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1189 transitions. Word has length 145 [2019-10-02 00:42:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:05,894 INFO L475 AbstractCegarLoop]: Abstraction has 959 states and 1189 transitions. [2019-10-02 00:42:05,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:42:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1189 transitions. [2019-10-02 00:42:05,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 00:42:05,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:05,898 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:05,898 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:05,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:05,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1960590570, now seen corresponding path program 1 times [2019-10-02 00:42:05,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:05,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:05,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:05,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:05,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:42:06,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:42:06,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 00:42:06,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 00:42:06,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 00:42:06,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 00:42:06,011 INFO L87 Difference]: Start difference. First operand 959 states and 1189 transitions. Second operand 4 states. [2019-10-02 00:42:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:06,772 INFO L93 Difference]: Finished difference Result 2994 states and 3801 transitions. [2019-10-02 00:42:06,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:42:06,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-10-02 00:42:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:06,792 INFO L225 Difference]: With dead ends: 2994 [2019-10-02 00:42:06,792 INFO L226 Difference]: Without dead ends: 2041 [2019-10-02 00:42:06,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-02 00:42:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2019-10-02 00:42:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 1231. [2019-10-02 00:42:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-10-02 00:42:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1530 transitions. [2019-10-02 00:42:06,875 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1530 transitions. Word has length 165 [2019-10-02 00:42:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:06,877 INFO L475 AbstractCegarLoop]: Abstraction has 1231 states and 1530 transitions. [2019-10-02 00:42:06,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 00:42:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1530 transitions. [2019-10-02 00:42:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 00:42:06,881 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:06,882 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:06,882 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:06,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:06,883 INFO L82 PathProgramCache]: Analyzing trace with hash 425097878, now seen corresponding path program 1 times [2019-10-02 00:42:06,883 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:06,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:06,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:42:07,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:42:07,043 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:42:07,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:07,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 00:42:07,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:42:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:42:07,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:42:07,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 00:42:07,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 00:42:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 00:42:07,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 00:42:07,413 INFO L87 Difference]: Start difference. First operand 1231 states and 1530 transitions. Second operand 8 states. [2019-10-02 00:42:08,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:08,968 INFO L93 Difference]: Finished difference Result 2943 states and 3826 transitions. [2019-10-02 00:42:08,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 00:42:08,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 176 [2019-10-02 00:42:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:08,969 INFO L225 Difference]: With dead ends: 2943 [2019-10-02 00:42:08,969 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 00:42:08,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2019-10-02 00:42:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 00:42:08,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 00:42:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 00:42:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 00:42:08,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2019-10-02 00:42:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:08,981 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 00:42:08,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 00:42:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 00:42:08,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 00:42:08,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 00:42:09,618 WARN L191 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2019-10-02 00:42:09,747 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-02 00:42:09,885 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-02 00:42:09,888 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:42:09,889 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a20~0 |old(~a20~0)|)) [2019-10-02 00:42:09,889 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:42:09,889 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-02 00:42:09,889 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-02 00:42:09,889 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,889 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,889 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,890 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,890 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,890 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,890 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-02 00:42:09,890 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-02 00:42:09,890 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-02 00:42:09,890 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-02 00:42:09,891 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-02 00:42:09,891 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-02 00:42:09,891 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-02 00:42:09,891 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-02 00:42:09,891 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-02 00:42:09,891 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-02 00:42:09,891 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,891 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,892 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,892 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,892 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,892 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,892 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-02 00:42:09,892 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-02 00:42:09,892 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-02 00:42:09,892 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-02 00:42:09,893 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-02 00:42:09,893 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-02 00:42:09,893 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-02 00:42:09,893 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-02 00:42:09,893 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-02 00:42:09,893 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-02 00:42:09,893 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-02 00:42:09,893 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-02 00:42:09,894 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-02 00:42:09,894 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-02 00:42:09,894 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-02 00:42:09,894 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,894 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,894 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,894 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,895 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,895 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-02 00:42:09,895 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-02 00:42:09,895 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-02 00:42:09,895 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-02 00:42:09,895 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-02 00:42:09,895 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-02 00:42:09,896 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-02 00:42:09,896 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-02 00:42:09,896 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-02 00:42:09,896 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,896 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,896 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,896 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,896 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,897 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-02 00:42:09,897 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-02 00:42:09,897 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-02 00:42:09,897 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-02 00:42:09,897 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-02 00:42:09,897 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-02 00:42:09,897 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-02 00:42:09,897 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-02 00:42:09,898 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-02 00:42:09,898 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-02 00:42:09,898 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-02 00:42:09,898 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-02 00:42:09,898 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-02 00:42:09,898 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,898 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,898 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,899 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,899 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,899 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-02 00:42:09,899 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-02 00:42:09,899 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-02 00:42:09,899 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-02 00:42:09,899 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2019-10-02 00:42:09,899 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-02 00:42:09,900 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-02 00:42:09,900 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-02 00:42:09,900 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-02 00:42:09,900 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-02 00:42:09,900 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,900 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,900 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,901 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,901 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,901 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,901 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-02 00:42:09,901 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,901 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-02 00:42:09,901 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-02 00:42:09,901 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-02 00:42:09,901 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-02 00:42:09,902 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-02 00:42:09,902 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-02 00:42:09,902 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-02 00:42:09,902 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-02 00:42:09,902 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-02 00:42:09,902 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-02 00:42:09,902 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-02 00:42:09,902 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-02 00:42:09,903 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-02 00:42:09,903 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,903 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,903 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,903 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,903 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,903 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-02 00:42:09,903 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-02 00:42:09,904 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-02 00:42:09,904 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-02 00:42:09,904 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-02 00:42:09,904 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-02 00:42:09,904 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-02 00:42:09,904 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-02 00:42:09,904 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,904 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,905 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,905 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,905 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,905 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-02 00:42:09,905 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-02 00:42:09,905 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-02 00:42:09,905 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-02 00:42:09,905 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-02 00:42:09,906 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-02 00:42:09,906 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-02 00:42:09,906 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-02 00:42:09,906 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-02 00:42:09,906 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-02 00:42:09,907 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a17~0 |old(~a17~0)|)) (.cse1 (<= ~a21~0 |old(~a21~0)|)) (.cse2 (= ~a16~0 |old(~a16~0)|)) (.cse4 (= ~a20~0 |old(~a20~0)|))) (let ((.cse3 (= 13 ~a8~0)) (.cse6 (= 13 |old(~a8~0)|)) (.cse11 (not (= 15 |old(~a8~0)|))) (.cse10 (= 15 ~a8~0)) (.cse5 (= 6 |old(~a16~0)|)) (.cse14 (and .cse0 .cse1 .cse2 .cse4)) (.cse13 (not (<= |old(~a21~0)| 0))) (.cse8 (= 1 |old(~a7~0)|)) (.cse12 (not (= 1 |old(~a20~0)|))) (.cse7 (not (= 8 ~a12~0))) (.cse9 (not (= ~a7~0 1)))) (and (or (and .cse0 .cse1 (and .cse2 (not .cse3)) .cse4) (or .cse5 .cse6 .cse7)) (or .cse5 .cse8 (and .cse9 .cse0 .cse1 .cse2 .cse4) .cse7) (or (or .cse10 .cse9) (or .cse5 .cse11 .cse7)) (or (not (= 1 |old(~a21~0)|)) .cse12 (not (= 4 |old(~a16~0)|)) .cse7 (not .cse8) (and (= 1 ~a7~0) .cse3 .cse2 (= ~a17~0 1) (= ~a21~0 1) (= ~a20~0 1)) (not .cse6) (not (= 1 |old(~a17~0)|))) (or .cse8 .cse11 .cse7 (and .cse9 .cse0 .cse1 .cse2 .cse10 .cse4)) (or .cse12 .cse7 .cse13 .cse14) (or .cse5 .cse14 .cse7 .cse13) (or (or .cse8 .cse12 .cse7) (and .cse9 .cse0 .cse2 .cse1 .cse4))))) [2019-10-02 00:42:09,907 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-02 00:42:09,907 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,907 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,907 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,907 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,907 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-02 00:42:09,908 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,908 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,908 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-02 00:42:09,908 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-02 00:42:09,908 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-02 00:42:09,908 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-02 00:42:09,908 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-02 00:42:09,908 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-02 00:42:09,909 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-02 00:42:09,909 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-02 00:42:09,909 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-02 00:42:09,909 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-02 00:42:09,909 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-02 00:42:09,909 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-02 00:42:09,909 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,909 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,910 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,910 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,910 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,910 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-02 00:42:09,910 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,910 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-02 00:42:09,910 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-02 00:42:09,910 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-02 00:42:09,911 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-02 00:42:09,911 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-02 00:42:09,911 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-02 00:42:09,911 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-02 00:42:09,911 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-02 00:42:09,911 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-02 00:42:09,911 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-02 00:42:09,911 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-02 00:42:09,912 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-02 00:42:09,912 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-02 00:42:09,912 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-02 00:42:09,912 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,912 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,912 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,912 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,912 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,913 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:09,913 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-02 00:42:09,913 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-02 00:42:09,913 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-02 00:42:09,913 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-02 00:42:09,913 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-02 00:42:09,913 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-02 00:42:09,913 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-02 00:42:09,913 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-02 00:42:09,914 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-02 00:42:09,914 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-02 00:42:09,914 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:42:09,914 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a7~0 1)) (not (= ~a16~0 6)) (= ~a17~0 1) (= ~a12~0 8) (= ~a20~0 1) (= 15 ~a8~0)) [2019-10-02 00:42:09,914 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 00:42:09,914 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:42:09,915 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 1 |old(~a7~0)|) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (and (not (= ~a7~0 1)) (<= ~a21~0 |old(~a21~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a17~0 1) (= 15 ~a8~0) (= ~a20~0 |old(~a20~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|))) [2019-10-02 00:42:09,915 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-02 00:42:09,915 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (<= ~a21~0 0)) (.cse2 (= ~a20~0 1)) (.cse0 (not (= ~a7~0 1))) (.cse3 (not (= ~a16~0 6)))) (or (and .cse0 (= 15 ~a8~0)) (and .cse1 .cse2) (= 6 |old(~a16~0)|) (not (= 8 ~a12~0)) (and .cse1 .cse3) (not (= 1 |old(~a17~0)|)) (= 1 |old(~a7~0)|) (and (= ~a16~0 4) (= ~a17~0 1) (= ~a21~0 1) .cse2) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse3 (not (= 13 ~a8~0))) (and .cse0 .cse2) (and .cse0 .cse3))) [2019-10-02 00:42:09,915 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-02 00:42:09,915 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-02 00:42:09,915 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (<= ~a21~0 0)) (.cse2 (= ~a20~0 1)) (.cse0 (not (= ~a7~0 1))) (.cse3 (not (= ~a16~0 6)))) (or (and .cse0 (= 15 ~a8~0)) (and .cse1 .cse2) (= 6 |old(~a16~0)|) (not (= 8 ~a12~0)) (and .cse1 .cse3) (not (= 1 |old(~a17~0)|)) (= 1 |old(~a7~0)|) (and (= ~a16~0 4) (= ~a17~0 1) (= ~a21~0 1) .cse2) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse3 (not (= 13 ~a8~0))) (and .cse0 .cse2) (and .cse0 .cse3))) [2019-10-02 00:42:09,916 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-02 00:42:09,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:42:09 BoogieIcfgContainer [2019-10-02 00:42:09,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 00:42:09,935 INFO L168 Benchmark]: Toolchain (without parser) took 10530.17 ms. Allocated memory was 140.5 MB in the beginning and 418.4 MB in the end (delta: 277.9 MB). Free memory was 86.3 MB in the beginning and 281.7 MB in the end (delta: -195.4 MB). Peak memory consumption was 238.2 MB. Max. memory is 7.1 GB. [2019-10-02 00:42:09,936 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory is still 106.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 00:42:09,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.87 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 85.9 MB in the beginning and 164.8 MB in the end (delta: -78.9 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. [2019-10-02 00:42:09,938 INFO L168 Benchmark]: Boogie Preprocessor took 120.54 ms. Allocated memory is still 202.4 MB. Free memory was 164.8 MB in the beginning and 160.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. [2019-10-02 00:42:09,939 INFO L168 Benchmark]: RCFGBuilder took 1249.52 ms. Allocated memory was 202.4 MB in the beginning and 228.1 MB in the end (delta: 25.7 MB). Free memory was 160.2 MB in the beginning and 173.6 MB in the end (delta: -13.4 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. [2019-10-02 00:42:09,940 INFO L168 Benchmark]: TraceAbstraction took 8459.78 ms. Allocated memory was 228.1 MB in the beginning and 418.4 MB in the end (delta: 190.3 MB). Free memory was 173.6 MB in the beginning and 281.7 MB in the end (delta: -108.1 MB). Peak memory consumption was 237.9 MB. Max. memory is 7.1 GB. [2019-10-02 00:42:09,944 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.21 ms. Allocated memory is still 140.5 MB. Free memory is still 106.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 695.87 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 85.9 MB in the beginning and 164.8 MB in the end (delta: -78.9 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.54 ms. Allocated memory is still 202.4 MB. Free memory was 164.8 MB in the beginning and 160.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1249.52 ms. Allocated memory was 202.4 MB in the beginning and 228.1 MB in the end (delta: 25.7 MB). Free memory was 160.2 MB in the beginning and 173.6 MB in the end (delta: -13.4 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8459.78 ms. Allocated memory was 228.1 MB in the beginning and 418.4 MB in the end (delta: 190.3 MB). Free memory was 173.6 MB in the beginning and 281.7 MB in the end (delta: -108.1 MB). Peak memory consumption was 237.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((((!(a7 == 1) && 15 == a8) || (a21 <= 0 && a20 == 1)) || 6 == \old(a16)) || !(8 == a12)) || (a21 <= 0 && !(a16 == 6))) || !(1 == \old(a17))) || 1 == \old(a7)) || (((a16 == 4 && a17 == 1) && a21 == 1) && a20 == 1)) || !(1 == \old(a20))) || !(15 == \old(a8))) || (!(a16 == 6) && !(13 == a8))) || (!(a7 == 1) && a20 == 1)) || (!(a7 == 1) && !(a16 == 6)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. SAFE Result, 8.3s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 1669 SDslu, 231 SDs, 0 SdLazy, 3629 SolverSat, 575 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 199 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1231occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 824 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 55 PreInvPairs, 99 NumberOfFragments, 489 HoareAnnotationTreeSize, 55 FomulaSimplifications, 2152 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 773 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1073 NumberOfCodeBlocks, 1073 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1066 ConstructedInterpolants, 0 QuantifiedInterpolants, 732734 SizeOfPredicates, 2 NumberOfNonLiveVariables, 458 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 152/181 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...