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/Problem02_label53.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:48:24,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:48:24,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:48:24,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:48:24,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:48:24,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:48:24,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:48:24,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:48:24,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:48:24,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:48:24,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:48:24,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:48:24,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:48:24,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:48:24,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:48:24,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:48:24,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:48:24,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:48:24,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:48:24,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:48:24,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:48:24,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:48:24,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:48:24,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:48:24,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:48:24,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:48:24,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:48:24,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:48:24,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:48:24,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:48:24,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:48:24,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:48:24,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:48:24,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:48:24,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:48:24,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:48:24,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:48:24,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:48:24,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:48:24,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:48:24,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:48:24,684 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:48:24,698 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:48:24,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:48:24,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:48:24,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:48:24,700 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:48:24,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:48:24,700 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:48:24,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:48:24,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:48:24,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:48:24,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:48:24,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:48:24,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:48:24,701 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:48:24,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:48:24,702 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:48:24,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:48:24,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:48:24,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:48:24,702 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:48:24,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:48:24,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:48:24,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:48:24,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:48:24,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:48:24,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:48:24,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:48:24,704 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:48:24,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:48:24,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:48:24,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:48:24,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:48:24,747 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:48:24,747 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:48:24,748 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label53.c [2019-10-02 00:48:24,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114da156d/2f8029554f2a4c159704dfb820d21189/FLAGbe2d87843 [2019-10-02 00:48:25,296 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:48:25,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label53.c [2019-10-02 00:48:25,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114da156d/2f8029554f2a4c159704dfb820d21189/FLAGbe2d87843 [2019-10-02 00:48:25,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114da156d/2f8029554f2a4c159704dfb820d21189 [2019-10-02 00:48:25,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:48:25,625 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:48:25,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:48:25,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:48:25,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:48:25,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:48:25" (1/1) ... [2019-10-02 00:48:25,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390945f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:25, skipping insertion in model container [2019-10-02 00:48:25,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:48:25" (1/1) ... [2019-10-02 00:48:25,641 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:48:25,701 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:48:26,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:48:26,265 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:48:26,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:48:26,387 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:48:26,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:26 WrapperNode [2019-10-02 00:48:26,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:48:26,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:48:26,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:48:26,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:48:26,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:26" (1/1) ... [2019-10-02 00:48:26,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:26" (1/1) ... [2019-10-02 00:48:26,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:26" (1/1) ... [2019-10-02 00:48:26,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:26" (1/1) ... [2019-10-02 00:48:26,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:26" (1/1) ... [2019-10-02 00:48:26,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:26" (1/1) ... [2019-10-02 00:48:26,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:26" (1/1) ... [2019-10-02 00:48:26,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:48:26,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:48:26,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:48:26,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:48:26,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:48:26,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:48:26,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:48:26,651 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 00:48:26,651 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:48:26,651 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 00:48:26,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:48:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:48:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 00:48:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:48:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:48:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:48:28,003 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:48:28,003 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 00:48:28,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:28 BoogieIcfgContainer [2019-10-02 00:48:28,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:48:28,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:48:28,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:48:28,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:48:28,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:48:25" (1/3) ... [2019-10-02 00:48:28,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1a7c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:48:28, skipping insertion in model container [2019-10-02 00:48:28,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:26" (2/3) ... [2019-10-02 00:48:28,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1a7c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:48:28, skipping insertion in model container [2019-10-02 00:48:28,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:28" (3/3) ... [2019-10-02 00:48:28,013 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label53.c [2019-10-02 00:48:28,022 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:48:28,030 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:48:28,047 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:48:28,092 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:48:28,093 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:48:28,095 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:48:28,096 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:48:28,096 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:48:28,096 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:48:28,096 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:48:28,096 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:48:28,097 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:48:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 00:48:28,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 00:48:28,148 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:28,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:28,152 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:28,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1422395146, now seen corresponding path program 1 times [2019-10-02 00:48:28,160 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:28,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:28,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:28,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:28,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:28,787 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:48:28,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:28,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:48:28,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:48:28,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:48:28,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:48:28,811 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 00:48:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:29,891 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-02 00:48:29,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:48:29,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-02 00:48:29,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:29,925 INFO L225 Difference]: With dead ends: 618 [2019-10-02 00:48:29,926 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:29,937 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:48:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 00:48:30,057 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 144 [2019-10-02 00:48:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:30,058 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 00:48:30,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:48:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 00:48:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 00:48:30,071 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:30,072 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:30,072 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:30,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:30,072 INFO L82 PathProgramCache]: Analyzing trace with hash 339587089, now seen corresponding path program 1 times [2019-10-02 00:48:30,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:30,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:30,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:30,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:30,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:30,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:30,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:30,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:30,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:30,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:30,442 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 00:48:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:31,088 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-02 00:48:31,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:31,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-10-02 00:48:31,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:31,094 INFO L225 Difference]: With dead ends: 721 [2019-10-02 00:48:31,094 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:31,096 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:48:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 00:48:31,113 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 152 [2019-10-02 00:48:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:31,114 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 00:48:31,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 00:48:31,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 00:48:31,119 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:31,120 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:31,120 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:31,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:31,120 INFO L82 PathProgramCache]: Analyzing trace with hash -84143163, now seen corresponding path program 1 times [2019-10-02 00:48:31,121 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:31,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:31,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:31,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:31,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:31,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:31,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:31,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:31,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:31,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:31,451 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 00:48:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:32,055 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-02 00:48:32,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:32,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-02 00:48:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:32,059 INFO L225 Difference]: With dead ends: 717 [2019-10-02 00:48:32,059 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:32,060 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:48:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 00:48:32,082 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 158 [2019-10-02 00:48:32,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:32,082 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 00:48:32,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:32,082 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 00:48:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 00:48:32,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:32,085 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 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:48:32,085 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash 284152846, now seen corresponding path program 1 times [2019-10-02 00:48:32,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:32,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:32,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:32,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:32,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:32,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:48:32,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:48:32,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:48:32,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:48:32,239 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 00:48:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:32,978 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-02 00:48:32,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:48:32,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-10-02 00:48:32,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:32,987 INFO L225 Difference]: With dead ends: 951 [2019-10-02 00:48:32,987 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 00:48:32,989 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:48:32,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 00:48:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 00:48:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2019-10-02 00:48:33,026 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 166 [2019-10-02 00:48:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:33,026 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2019-10-02 00:48:33,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:48:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2019-10-02 00:48:33,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 00:48:33,030 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:33,030 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:33,030 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:33,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:33,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2061838006, now seen corresponding path program 1 times [2019-10-02 00:48:33,031 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:33,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:33,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:33,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:33,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:33,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:33,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:33,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:33,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:33,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:33,293 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2019-10-02 00:48:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:33,949 INFO L93 Difference]: Finished difference Result 1330 states and 1901 transitions. [2019-10-02 00:48:33,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:33,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-10-02 00:48:33,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:33,953 INFO L225 Difference]: With dead ends: 1330 [2019-10-02 00:48:33,954 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:48:33,956 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:48:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:48:33,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:48:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2019-10-02 00:48:33,976 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 168 [2019-10-02 00:48:33,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:33,976 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2019-10-02 00:48:33,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:33,977 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2019-10-02 00:48:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 00:48:33,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:33,980 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:33,980 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:33,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:33,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2138250886, now seen corresponding path program 1 times [2019-10-02 00:48:33,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:33,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:33,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:33,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:33,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:34,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:34,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:34,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:34,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:34,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:34,245 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2019-10-02 00:48:34,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:34,866 INFO L93 Difference]: Finished difference Result 1332 states and 1876 transitions. [2019-10-02 00:48:34,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:34,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-10-02 00:48:34,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:34,871 INFO L225 Difference]: With dead ends: 1332 [2019-10-02 00:48:34,871 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:48:34,874 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:48:34,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:48:34,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:48:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2019-10-02 00:48:34,897 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 170 [2019-10-02 00:48:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:34,898 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2019-10-02 00:48:34,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2019-10-02 00:48:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 00:48:34,903 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:34,903 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:34,903 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:34,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:34,904 INFO L82 PathProgramCache]: Analyzing trace with hash 23816446, now seen corresponding path program 1 times [2019-10-02 00:48:34,904 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:34,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:34,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:34,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:34,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:35,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:35,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:48:35,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:48:35,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:48:35,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:48:35,046 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2019-10-02 00:48:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:35,735 INFO L93 Difference]: Finished difference Result 1858 states and 2598 transitions. [2019-10-02 00:48:35,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:48:35,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2019-10-02 00:48:35,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:35,747 INFO L225 Difference]: With dead ends: 1858 [2019-10-02 00:48:35,747 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 00:48:35,750 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:48:35,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 00:48:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 00:48:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 00:48:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1634 transitions. [2019-10-02 00:48:35,803 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1634 transitions. Word has length 174 [2019-10-02 00:48:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:35,804 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1634 transitions. [2019-10-02 00:48:35,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:48:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1634 transitions. [2019-10-02 00:48:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 00:48:35,810 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:35,811 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:35,811 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:35,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:35,812 INFO L82 PathProgramCache]: Analyzing trace with hash 141476734, now seen corresponding path program 1 times [2019-10-02 00:48:35,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:35,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:35,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:35,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:35,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:35,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:48:35,950 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:48:35,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:36,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:48:36,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:48:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:48:36,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:48:36,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 00:48:36,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 00:48:36,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 00:48:36,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 00:48:36,244 INFO L87 Difference]: Start difference. First operand 1218 states and 1634 transitions. Second operand 7 states. [2019-10-02 00:48:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:37,532 INFO L93 Difference]: Finished difference Result 3651 states and 5063 transitions. [2019-10-02 00:48:37,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:48:37,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 208 [2019-10-02 00:48:37,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:37,544 INFO L225 Difference]: With dead ends: 3651 [2019-10-02 00:48:37,544 INFO L226 Difference]: Without dead ends: 1542 [2019-10-02 00:48:37,554 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-02 00:48:37,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-10-02 00:48:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1518. [2019-10-02 00:48:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1518 states. [2019-10-02 00:48:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1898 transitions. [2019-10-02 00:48:37,605 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1898 transitions. Word has length 208 [2019-10-02 00:48:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:37,605 INFO L475 AbstractCegarLoop]: Abstraction has 1518 states and 1898 transitions. [2019-10-02 00:48:37,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 00:48:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1898 transitions. [2019-10-02 00:48:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 00:48:37,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:37,613 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-10-02 00:48:37,614 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:37,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:37,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1207314428, now seen corresponding path program 1 times [2019-10-02 00:48:37,614 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:37,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:37,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:37,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:37,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 139 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:37,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:48:37,892 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:48:37,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:38,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:48:38,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:48:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 153 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:48:38,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:48:38,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-10-02 00:48:38,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 00:48:38,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 00:48:38,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-10-02 00:48:38,127 INFO L87 Difference]: Start difference. First operand 1518 states and 1898 transitions. Second operand 14 states. [2019-10-02 00:48:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:40,482 INFO L93 Difference]: Finished difference Result 3186 states and 3998 transitions. [2019-10-02 00:48:40,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:48:40,483 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 259 [2019-10-02 00:48:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:40,484 INFO L225 Difference]: With dead ends: 3186 [2019-10-02 00:48:40,484 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 00:48:40,494 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2019-10-02 00:48:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 00:48:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 00:48:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 00:48:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 00:48:40,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 259 [2019-10-02 00:48:40,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:40,496 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 00:48:40,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 00:48:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 00:48:40,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 00:48:40,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 00:48:41,482 WARN L191 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-10-02 00:48:41,823 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-10-02 00:48:42,151 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-10-02 00:48:42,154 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:48:42,155 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-10-02 00:48:42,155 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:48:42,155 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,155 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,155 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,155 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,155 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,156 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-02 00:48:42,156 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-02 00:48:42,156 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-10-02 00:48:42,156 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-10-02 00:48:42,156 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-10-02 00:48:42,156 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-10-02 00:48:42,156 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-10-02 00:48:42,156 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-02 00:48:42,157 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-02 00:48:42,157 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-02 00:48:42,157 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:48:42,157 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:48:42,157 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-02 00:48:42,157 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,157 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,158 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,158 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,158 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-02 00:48:42,158 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,158 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-02 00:48:42,158 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-10-02 00:48:42,158 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-02 00:48:42,158 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-02 00:48:42,159 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-10-02 00:48:42,159 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-10-02 00:48:42,159 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-02 00:48:42,159 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:48:42,159 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:48:42,159 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-02 00:48:42,159 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-02 00:48:42,159 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-02 00:48:42,160 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:48:42,160 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:48:42,160 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-02 00:48:42,160 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,160 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,160 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,160 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,160 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,161 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:48:42,161 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-02 00:48:42,161 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:48:42,161 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-10-02 00:48:42,161 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-10-02 00:48:42,161 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-10-02 00:48:42,161 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-10-02 00:48:42,161 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-02 00:48:42,162 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 586) no Hoare annotation was computed. [2019-10-02 00:48:42,162 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-02 00:48:42,162 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-02 00:48:42,162 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-02 00:48:42,162 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,162 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,162 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,163 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,163 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,163 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-02 00:48:42,163 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-02 00:48:42,163 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-02 00:48:42,163 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-10-02 00:48:42,163 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-10-02 00:48:42,163 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-10-02 00:48:42,163 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-10-02 00:48:42,164 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-10-02 00:48:42,164 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-02 00:48:42,164 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-02 00:48:42,164 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-02 00:48:42,164 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-02 00:48:42,164 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-02 00:48:42,164 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,164 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,164 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,165 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,165 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,165 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-02 00:48:42,165 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-10-02 00:48:42,165 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-02 00:48:42,165 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-02 00:48:42,165 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-10-02 00:48:42,165 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-10-02 00:48:42,166 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-02 00:48:42,166 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-02 00:48:42,166 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-02 00:48:42,166 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-02 00:48:42,166 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-02 00:48:42,166 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-02 00:48:42,166 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-02 00:48:42,166 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:48:42,167 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-02 00:48:42,167 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:48:42,167 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,167 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,167 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,167 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,167 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-02 00:48:42,167 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,168 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:48:42,168 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,168 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:48:42,168 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:48:42,168 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:48:42,168 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,168 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,168 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-02 00:48:42,168 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-10-02 00:48:42,169 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-02 00:48:42,169 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-10-02 00:48:42,169 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-02 00:48:42,169 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-10-02 00:48:42,169 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-02 00:48:42,169 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-02 00:48:42,169 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-02 00:48:42,170 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-02 00:48:42,170 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-02 00:48:42,170 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,170 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,170 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,170 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,170 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,170 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,171 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-02 00:48:42,171 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-10-02 00:48:42,171 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-02 00:48:42,171 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-10-02 00:48:42,171 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-10-02 00:48:42,171 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-10-02 00:48:42,171 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-10-02 00:48:42,171 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-02 00:48:42,171 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-02 00:48:42,172 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-02 00:48:42,172 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-02 00:48:42,172 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,172 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,172 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,172 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,172 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,172 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,172 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-02 00:48:42,173 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-02 00:48:42,173 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-02 00:48:42,173 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-10-02 00:48:42,173 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-10-02 00:48:42,173 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-10-02 00:48:42,173 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-10-02 00:48:42,173 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-10-02 00:48:42,173 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-02 00:48:42,174 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-02 00:48:42,174 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-02 00:48:42,174 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-02 00:48:42,174 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-02 00:48:42,174 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-02 00:48:42,174 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,174 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,174 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,175 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse14 (= 1 |old(~a19~0)|)) (.cse1 (= 1 |old(~a11~0)|)) (.cse6 (= 1 |old(~a25~0)|)) (.cse7 (not (= 1 ~a11~0))) (.cse15 (= ~a17~0 |old(~a17~0)|)) (.cse16 (= ~a19~0 |old(~a19~0)|)) (.cse17 (= ~a28~0 |old(~a28~0)|)) (.cse18 (= ~a25~0 |old(~a25~0)|))) (let ((.cse3 (and .cse7 .cse15 .cse16 .cse17 .cse18)) (.cse12 (not (= 7 |old(~a28~0)|))) (.cse5 (= 9 |old(~a28~0)|)) (.cse9 (not .cse6)) (.cse11 (not .cse1)) (.cse10 (= ~a11~0 1)) (.cse8 (not (<= |old(~a17~0)| 7))) (.cse0 (not (= 1 ~a21~0))) (.cse2 (not .cse14)) (.cse13 (= 8 |old(~a28~0)|)) (.cse4 (not (= 8 |old(~a17~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse3 .cse5 .cse4 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse5 .cse8) (or .cse0 .cse9 .cse2 .cse4 .cse10 (not .cse5) .cse11) (or .cse0 .cse12 .cse9 .cse2 (and (= ~a17~0 7) .cse10) .cse11 (not (= 7 |old(~a17~0)|))) (or .cse0 .cse1 .cse13 .cse5 .cse4 .cse3) (or .cse0 .cse1 .cse7 .cse8 .cse6) (or .cse14 .cse0 .cse12 (and (not (= ~a19~0 1)) (not (= ~a25~0 1)) (= ~a17~0 8) (= ~a28~0 7) .cse10) .cse4 .cse11 .cse6) (or .cse0 .cse1 .cse2 .cse13 .cse15 .cse5 (not (<= |old(~a17~0)| 8)) .cse6) (or .cse0 (not (= 10 |old(~a28~0)|)) .cse9 .cse2 .cse4 .cse11 .cse10) (or .cse0 (and (<= ~a17~0 7) .cse16 .cse17 .cse18) .cse8) (or .cse0 .cse2 (and .cse15 .cse16 .cse17 .cse18) .cse13 .cse4)))) [2019-10-02 00:48:42,175 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,175 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,175 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,175 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-02 00:48:42,175 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-02 00:48:42,176 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-02 00:48:42,176 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-10-02 00:48:42,176 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-10-02 00:48:42,176 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-10-02 00:48:42,176 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-10-02 00:48:42,176 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-10-02 00:48:42,176 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-10-02 00:48:42,176 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-02 00:48:42,177 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-02 00:48:42,177 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-02 00:48:42,177 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-02 00:48:42,177 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,177 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,177 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,177 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,177 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,178 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,178 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-02 00:48:42,178 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-02 00:48:42,178 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-10-02 00:48:42,178 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-10-02 00:48:42,178 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-02 00:48:42,178 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-10-02 00:48:42,178 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-02 00:48:42,179 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-10-02 00:48:42,179 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-02 00:48:42,179 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-02 00:48:42,179 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-02 00:48:42,179 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:48:42,179 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:48:42,179 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-02 00:48:42,179 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-02 00:48:42,180 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-02 00:48:42,180 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,180 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,180 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,180 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,180 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:42,180 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-02 00:48:42,180 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-02 00:48:42,181 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-02 00:48:42,181 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-02 00:48:42,181 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-02 00:48:42,181 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-02 00:48:42,181 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-10-02 00:48:42,181 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-10-02 00:48:42,181 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-10-02 00:48:42,181 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-10-02 00:48:42,181 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-02 00:48:42,182 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:48:42,182 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-02 00:48:42,182 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:48:42,182 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-02 00:48:42,182 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:48:42,182 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:48:42,182 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-02 00:48:42,182 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-02 00:48:42,182 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:48:42,182 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~a11~0)) (not (= ~a25~0 1)) (not (= ~a28~0 8)) (= ~a19~0 1) (= ~a21~0 1) (<= ~a17~0 8) (not (= ~a28~0 9))) [2019-10-02 00:48:42,182 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 00:48:42,183 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:48:42,183 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (= 1 |old(~a11~0)|) (not (= 1 |old(~a19~0)|)) (= 8 |old(~a28~0)|) (and (not (= 1 ~a11~0)) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (= 9 |old(~a28~0)|) (not (<= |old(~a17~0)| 8)) (= 1 |old(~a25~0)|)) [2019-10-02 00:48:42,183 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse8 (= ~a28~0 9)) (.cse9 (= ~a25~0 1))) (let ((.cse2 (not (= ~a28~0 8))) (.cse0 (not (= 1 ~a11~0))) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse5 (not .cse9)) (.cse3 (not .cse8)) (.cse6 (= ~a17~0 8)) (.cse4 (= ~a19~0 1)) (.cse7 (= ~a11~0 1))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4) (and (not .cse4) .cse5 .cse6 (= ~a28~0 7) .cse7) (= 9 |old(~a28~0)|) (and .cse8 .cse6 .cse4 .cse9 .cse7) (<= ~a17~0 7) (= 1 |old(~a25~0)|) (and .cse1 .cse2 .cse4) (= 1 |old(~a11~0)|) (and .cse0 .cse1 .cse5 .cse3) (not (= 1 |old(~a19~0)|)) (= 8 |old(~a28~0)|) (and (= ~a28~0 10) .cse6 .cse4 .cse9 .cse7) (not (<= |old(~a17~0)| 8))))) [2019-10-02 00:48:42,183 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:48:42,183 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:48:42,183 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse8 (= ~a28~0 9)) (.cse9 (= ~a25~0 1))) (let ((.cse2 (not (= ~a28~0 8))) (.cse0 (not (= 1 ~a11~0))) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse5 (not .cse9)) (.cse3 (not .cse8)) (.cse6 (= ~a17~0 8)) (.cse4 (= ~a19~0 1)) (.cse7 (= ~a11~0 1))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4) (and (not .cse4) .cse5 .cse6 (= ~a28~0 7) .cse7) (= 9 |old(~a28~0)|) (and .cse8 .cse6 .cse4 .cse9 .cse7) (<= ~a17~0 7) (= 1 |old(~a25~0)|) (and .cse1 .cse2 .cse4) (= 1 |old(~a11~0)|) (and .cse0 .cse1 .cse5 .cse3) (not (= 1 |old(~a19~0)|)) (= 8 |old(~a28~0)|) (and (= ~a28~0 10) .cse6 .cse4 .cse9 .cse7) (not (<= |old(~a17~0)| 8))))) [2019-10-02 00:48:42,183 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-02 00:48:42,183 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-02 00:48:42,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:48:42 BoogieIcfgContainer [2019-10-02 00:48:42,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 00:48:42,205 INFO L168 Benchmark]: Toolchain (without parser) took 16579.83 ms. Allocated memory was 138.4 MB in the beginning and 534.8 MB in the end (delta: 396.4 MB). Free memory was 84.3 MB in the beginning and 113.4 MB in the end (delta: -29.1 MB). Peak memory consumption was 367.2 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:42,205 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory is still 104.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 00:48:42,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.03 ms. Allocated memory was 138.4 MB in the beginning and 197.7 MB in the end (delta: 59.2 MB). Free memory was 83.9 MB in the beginning and 155.6 MB in the end (delta: -71.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:42,207 INFO L168 Benchmark]: Boogie Preprocessor took 175.37 ms. Allocated memory is still 197.7 MB. Free memory was 155.6 MB in the beginning and 150.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:42,208 INFO L168 Benchmark]: RCFGBuilder took 1440.88 ms. Allocated memory was 197.7 MB in the beginning and 218.6 MB in the end (delta: 21.0 MB). Free memory was 150.9 MB in the beginning and 165.2 MB in the end (delta: -14.3 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:42,209 INFO L168 Benchmark]: TraceAbstraction took 14196.83 ms. Allocated memory was 218.6 MB in the beginning and 534.8 MB in the end (delta: 316.1 MB). Free memory was 165.2 MB in the beginning and 113.4 MB in the end (delta: 51.7 MB). Peak memory consumption was 367.9 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:42,213 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.22 ms. Allocated memory is still 138.4 MB. Free memory is still 104.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.03 ms. Allocated memory was 138.4 MB in the beginning and 197.7 MB in the end (delta: 59.2 MB). Free memory was 83.9 MB in the beginning and 155.6 MB in the end (delta: -71.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 175.37 ms. Allocated memory is still 197.7 MB. Free memory was 155.6 MB in the beginning and 150.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1440.88 ms. Allocated memory was 197.7 MB in the beginning and 218.6 MB in the end (delta: 21.0 MB). Free memory was 150.9 MB in the beginning and 165.2 MB in the end (delta: -14.3 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14196.83 ms. Allocated memory was 218.6 MB in the beginning and 534.8 MB in the end (delta: 316.1 MB). Free memory was 165.2 MB in the beginning and 113.4 MB in the end (delta: 51.7 MB). Peak memory consumption was 367.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 586]: 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: 606]: Loop Invariant Derived loop invariant: (((((((((((((!(1 == a21) || (((!(1 == a11) && a17 == \old(a17)) && !(a28 == 8)) && !(a28 == 9))) || ((!(1 == a11) && a17 == \old(a17)) && a19 == 1)) || ((((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && a28 == 7) && a11 == 1)) || 9 == \old(a28)) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1)) || a17 <= 7) || 1 == \old(a25)) || ((a17 == \old(a17) && !(a28 == 8)) && a19 == 1)) || 1 == \old(a11)) || (((!(1 == a11) && a17 == \old(a17)) && !(a25 == 1)) && !(a28 == 9))) || !(1 == \old(a19))) || 8 == \old(a28)) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1)) || !(\old(a17) <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. SAFE Result, 14.1s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 8.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 537 SDtfs, 5546 SDslu, 525 SDs, 0 SdLazy, 7227 SolverSat, 1261 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 575 GetRequests, 510 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1518occurred in iteration=8, 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.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 55 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 71 PreInvPairs, 127 NumberOfFragments, 700 HoareAnnotationTreeSize, 71 FomulaSimplifications, 2676 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1186 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2066 NumberOfCodeBlocks, 2066 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2055 ConstructedInterpolants, 0 QuantifiedInterpolants, 1713266 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1024 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 582/612 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...