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/Problem15_label44.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:44:53,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:44:53,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:44:53,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:44:53,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:44:53,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:44:54,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:44:54,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:44:54,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:44:54,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:44:54,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:44:54,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:44:54,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:44:54,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:44:54,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:44:54,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:44:54,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:44:54,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:44:54,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:44:54,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:44:54,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:44:54,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:44:54,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:44:54,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:44:54,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:44:54,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:44:54,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:44:54,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:44:54,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:44:54,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:44:54,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:44:54,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:44:54,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:44:54,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:44:54,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:44:54,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:44:54,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:44:54,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:44:54,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:44:54,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:44:54,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:44:54,029 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-09-07 20:44:54,043 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:44:54,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:44:54,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:44:54,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:44:54,045 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:44:54,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:44:54,045 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:44:54,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:44:54,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:44:54,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:44:54,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:44:54,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:44:54,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:44:54,047 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:44:54,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:44:54,047 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:44:54,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:44:54,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:44:54,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:44:54,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:44:54,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:44:54,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:44:54,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:44:54,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:44:54,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:44:54,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:44:54,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:44:54,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:44:54,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:44:54,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:44:54,095 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:44:54,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:44:54,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:44:54,101 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:44:54,102 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label44.c [2019-09-07 20:44:54,168 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb5392bdd/426ef2746d194ff39cba07e7ba4c3b6d/FLAG7bc01ee0e [2019-09-07 20:44:54,889 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:44:54,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label44.c [2019-09-07 20:44:54,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb5392bdd/426ef2746d194ff39cba07e7ba4c3b6d/FLAG7bc01ee0e [2019-09-07 20:44:55,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb5392bdd/426ef2746d194ff39cba07e7ba4c3b6d [2019-09-07 20:44:55,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:44:55,072 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:44:55,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:44:55,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:44:55,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:44:55,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:44:55" (1/1) ... [2019-09-07 20:44:55,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39268ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:44:55, skipping insertion in model container [2019-09-07 20:44:55,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:44:55" (1/1) ... [2019-09-07 20:44:55,091 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:44:55,181 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:44:56,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:44:56,128 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:44:56,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:44:56,504 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:44:56,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:44:56 WrapperNode [2019-09-07 20:44:56,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:44:56,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:44:56,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:44:56,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:44:56,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:44:56" (1/1) ... [2019-09-07 20:44:56,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:44:56" (1/1) ... [2019-09-07 20:44:56,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:44:56" (1/1) ... [2019-09-07 20:44:56,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:44:56" (1/1) ... [2019-09-07 20:44:56,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:44:56" (1/1) ... [2019-09-07 20:44:56,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:44:56" (1/1) ... [2019-09-07 20:44:56,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:44:56" (1/1) ... [2019-09-07 20:44:56,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:44:56,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:44:56,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:44:56,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:44:56,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:44:56" (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-09-07 20:44:56,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:44:56,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:44:56,805 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:44:56,806 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:44:56,806 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:44:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:44:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:44:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:44:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:44:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:44:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:44:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:44:56,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:45:00,066 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:45:00,067 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:45:00,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:45:00 BoogieIcfgContainer [2019-09-07 20:45:00,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:45:00,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:45:00,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:45:00,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:45:00,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:44:55" (1/3) ... [2019-09-07 20:45:00,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2792fb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:45:00, skipping insertion in model container [2019-09-07 20:45:00,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:44:56" (2/3) ... [2019-09-07 20:45:00,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2792fb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:45:00, skipping insertion in model container [2019-09-07 20:45:00,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:45:00" (3/3) ... [2019-09-07 20:45:00,076 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label44.c [2019-09-07 20:45:00,085 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:45:00,094 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:45:00,112 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:45:00,145 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:45:00,146 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:45:00,146 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:45:00,146 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:45:00,147 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:45:00,147 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:45:00,147 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:45:00,147 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:45:00,147 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:45:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:45:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 20:45:00,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:45:00,190 INFO L399 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] [2019-09-07 20:45:00,192 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:45:00,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:45:00,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1323114568, now seen corresponding path program 1 times [2019-09-07 20:45:00,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:45:00,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:45:00,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:00,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:00,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:45:00,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:45:00,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:45:00,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:45:00,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:45:00,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:45:00,682 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-09-07 20:45:05,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:45:05,531 INFO L93 Difference]: Finished difference Result 1497 states and 2757 transitions. [2019-09-07 20:45:05,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:45:05,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-07 20:45:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:45:05,572 INFO L225 Difference]: With dead ends: 1497 [2019-09-07 20:45:05,572 INFO L226 Difference]: Without dead ends: 993 [2019-09-07 20:45:05,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:45:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-09-07 20:45:05,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 682. [2019-09-07 20:45:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-07 20:45:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1002 transitions. [2019-09-07 20:45:05,695 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1002 transitions. Word has length 72 [2019-09-07 20:45:05,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:45:05,696 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1002 transitions. [2019-09-07 20:45:05,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:45:05,697 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1002 transitions. [2019-09-07 20:45:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-07 20:45:05,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:45:05,704 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:45:05,705 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:45:05,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:45:05,705 INFO L82 PathProgramCache]: Analyzing trace with hash 380539372, now seen corresponding path program 1 times [2019-09-07 20:45:05,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:45:05,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:45:05,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:05,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:05,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:45:05,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:45:05,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:45:05,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:45:05,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:45:05,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:45:05,914 INFO L87 Difference]: Start difference. First operand 682 states and 1002 transitions. Second operand 4 states. [2019-09-07 20:45:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:45:09,053 INFO L93 Difference]: Finished difference Result 2604 states and 3862 transitions. [2019-09-07 20:45:09,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:45:09,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-07 20:45:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:45:09,064 INFO L225 Difference]: With dead ends: 2604 [2019-09-07 20:45:09,064 INFO L226 Difference]: Without dead ends: 1928 [2019-09-07 20:45:09,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:45:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2019-09-07 20:45:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1617. [2019-09-07 20:45:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2019-09-07 20:45:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2218 transitions. [2019-09-07 20:45:09,133 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2218 transitions. Word has length 141 [2019-09-07 20:45:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:45:09,135 INFO L475 AbstractCegarLoop]: Abstraction has 1617 states and 2218 transitions. [2019-09-07 20:45:09,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:45:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2218 transitions. [2019-09-07 20:45:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-07 20:45:09,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:45:09,155 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:45:09,155 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:45:09,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:45:09,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1715878782, now seen corresponding path program 1 times [2019-09-07 20:45:09,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:45:09,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:45:09,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:09,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:09,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 133 proven. 87 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 20:45:09,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:45:09,619 INFO L223 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-09-07 20:45:09,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:09,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:45:09,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:45:09,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:45:09,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:45:09,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:45:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 223 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:45:10,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:45:10,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 20:45:10,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:45:10,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:45:10,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:45:10,101 INFO L87 Difference]: Start difference. First operand 1617 states and 2218 transitions. Second operand 11 states. [2019-09-07 20:45:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:45:20,091 INFO L93 Difference]: Finished difference Result 4711 states and 6907 transitions. [2019-09-07 20:45:20,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 20:45:20,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 290 [2019-09-07 20:45:20,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:45:20,156 INFO L225 Difference]: With dead ends: 4711 [2019-09-07 20:45:20,156 INFO L226 Difference]: Without dead ends: 3100 [2019-09-07 20:45:20,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=836, Invalid=3856, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 20:45:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-09-07 20:45:20,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2626. [2019-09-07 20:45:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2626 states. [2019-09-07 20:45:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3386 transitions. [2019-09-07 20:45:20,290 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 3386 transitions. Word has length 290 [2019-09-07 20:45:20,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:45:20,292 INFO L475 AbstractCegarLoop]: Abstraction has 2626 states and 3386 transitions. [2019-09-07 20:45:20,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:45:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 3386 transitions. [2019-09-07 20:45:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-07 20:45:20,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:45:20,299 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:45:20,300 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:45:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:45:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash 981875081, now seen corresponding path program 1 times [2019-09-07 20:45:20,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:45:20,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:45:20,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:20,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:20,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 213 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:45:20,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:45:20,656 INFO L223 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) [2019-09-07 20:45:20,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:45:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:20,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:45:20,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:45:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 213 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:45:21,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:45:21,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:45:21,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:45:21,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:45:21,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:45:21,083 INFO L87 Difference]: Start difference. First operand 2626 states and 3386 transitions. Second operand 9 states. [2019-09-07 20:45:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:45:26,966 INFO L93 Difference]: Finished difference Result 7924 states and 10980 transitions. [2019-09-07 20:45:26,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 20:45:26,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 357 [2019-09-07 20:45:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:45:26,995 INFO L225 Difference]: With dead ends: 7924 [2019-09-07 20:45:26,996 INFO L226 Difference]: Without dead ends: 5304 [2019-09-07 20:45:27,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:45:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5304 states. [2019-09-07 20:45:27,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5304 to 5260. [2019-09-07 20:45:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5260 states. [2019-09-07 20:45:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 6605 transitions. [2019-09-07 20:45:27,149 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 6605 transitions. Word has length 357 [2019-09-07 20:45:27,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:45:27,150 INFO L475 AbstractCegarLoop]: Abstraction has 5260 states and 6605 transitions. [2019-09-07 20:45:27,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:45:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 6605 transitions. [2019-09-07 20:45:27,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2019-09-07 20:45:27,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:45:27,162 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 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] [2019-09-07 20:45:27,162 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:45:27,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:45:27,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1276467130, now seen corresponding path program 1 times [2019-09-07 20:45:27,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:45:27,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:45:27,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:27,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:27,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-09-07 20:45:27,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:45:27,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:45:27,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:45:27,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:45:27,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:45:27,590 INFO L87 Difference]: Start difference. First operand 5260 states and 6605 transitions. Second operand 3 states. [2019-09-07 20:45:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:45:29,535 INFO L93 Difference]: Finished difference Result 11772 states and 15155 transitions. [2019-09-07 20:45:29,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:45:29,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 474 [2019-09-07 20:45:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:45:29,571 INFO L225 Difference]: With dead ends: 11772 [2019-09-07 20:45:29,571 INFO L226 Difference]: Without dead ends: 6518 [2019-09-07 20:45:29,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:45:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6518 states. [2019-09-07 20:45:29,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6518 to 6516. [2019-09-07 20:45:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6516 states. [2019-09-07 20:45:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6516 states to 6516 states and 8310 transitions. [2019-09-07 20:45:29,832 INFO L78 Accepts]: Start accepts. Automaton has 6516 states and 8310 transitions. Word has length 474 [2019-09-07 20:45:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:45:29,833 INFO L475 AbstractCegarLoop]: Abstraction has 6516 states and 8310 transitions. [2019-09-07 20:45:29,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:45:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 6516 states and 8310 transitions. [2019-09-07 20:45:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-09-07 20:45:29,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:45:29,859 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:45:29,860 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:45:29,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:45:29,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2019765074, now seen corresponding path program 1 times [2019-09-07 20:45:29,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:45:29,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:45:29,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:29,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:29,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 321 proven. 124 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-07 20:45:30,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:45:30,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:45:30,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:45:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:30,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:45:30,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:45:30,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:45:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:45:31,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:45:31,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:45:31,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:45:31,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:45:31,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:45:31,104 INFO L87 Difference]: Start difference. First operand 6516 states and 8310 transitions. Second operand 9 states. [2019-09-07 20:45:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:45:39,748 INFO L93 Difference]: Finished difference Result 22134 states and 30649 transitions. [2019-09-07 20:45:39,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:45:39,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 548 [2019-09-07 20:45:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:45:39,838 INFO L225 Difference]: With dead ends: 22134 [2019-09-07 20:45:39,838 INFO L226 Difference]: Without dead ends: 15624 [2019-09-07 20:45:39,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:45:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15624 states. [2019-09-07 20:45:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15624 to 14950. [2019-09-07 20:45:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14950 states. [2019-09-07 20:45:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14950 states to 14950 states and 20551 transitions. [2019-09-07 20:45:40,469 INFO L78 Accepts]: Start accepts. Automaton has 14950 states and 20551 transitions. Word has length 548 [2019-09-07 20:45:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:45:40,473 INFO L475 AbstractCegarLoop]: Abstraction has 14950 states and 20551 transitions. [2019-09-07 20:45:40,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:45:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 14950 states and 20551 transitions. [2019-09-07 20:45:40,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2019-09-07 20:45:40,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:45:40,508 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:45:40,508 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:45:40,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:45:40,509 INFO L82 PathProgramCache]: Analyzing trace with hash -773780819, now seen corresponding path program 1 times [2019-09-07 20:45:40,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:45:40,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:45:40,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:40,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:40,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 321 proven. 124 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-07 20:45:41,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:45:41,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:45:41,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:45:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:41,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:45:41,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:45:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 525 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 20:45:41,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:45:41,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:45:41,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:45:41,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:45:41,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:45:41,638 INFO L87 Difference]: Start difference. First operand 14950 states and 20551 transitions. Second operand 9 states. [2019-09-07 20:45:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:45:47,457 INFO L93 Difference]: Finished difference Result 31551 states and 49363 transitions. [2019-09-07 20:45:47,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:45:47,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 634 [2019-09-07 20:45:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:45:47,570 INFO L225 Difference]: With dead ends: 31551 [2019-09-07 20:45:47,570 INFO L226 Difference]: Without dead ends: 16914 [2019-09-07 20:45:47,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:45:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16914 states. [2019-09-07 20:45:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16914 to 16867. [2019-09-07 20:45:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16867 states. [2019-09-07 20:45:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16867 states to 16867 states and 27725 transitions. [2019-09-07 20:45:48,319 INFO L78 Accepts]: Start accepts. Automaton has 16867 states and 27725 transitions. Word has length 634 [2019-09-07 20:45:48,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:45:48,320 INFO L475 AbstractCegarLoop]: Abstraction has 16867 states and 27725 transitions. [2019-09-07 20:45:48,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:45:48,320 INFO L276 IsEmpty]: Start isEmpty. Operand 16867 states and 27725 transitions. [2019-09-07 20:45:48,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2019-09-07 20:45:48,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:45:48,364 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:45:48,365 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:45:48,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:45:48,365 INFO L82 PathProgramCache]: Analyzing trace with hash -325515717, now seen corresponding path program 1 times [2019-09-07 20:45:48,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:45:48,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:45:48,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:48,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:48,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 274 proven. 2 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-09-07 20:45:49,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:45:49,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:45:49,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:45:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:49,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:45:49,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:45:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2019-09-07 20:45:50,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:45:50,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:45:50,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:45:50,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:45:50,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:45:50,156 INFO L87 Difference]: Start difference. First operand 16867 states and 27725 transitions. Second operand 3 states. [2019-09-07 20:45:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:45:52,214 INFO L93 Difference]: Finished difference Result 33734 states and 55608 transitions. [2019-09-07 20:45:52,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:45:52,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 685 [2019-09-07 20:45:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:45:52,321 INFO L225 Difference]: With dead ends: 33734 [2019-09-07 20:45:52,321 INFO L226 Difference]: Without dead ends: 17180 [2019-09-07 20:45:52,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:45:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17180 states. [2019-09-07 20:45:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17180 to 17180. [2019-09-07 20:45:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17180 states. [2019-09-07 20:45:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17180 states to 17180 states and 28057 transitions. [2019-09-07 20:45:52,999 INFO L78 Accepts]: Start accepts. Automaton has 17180 states and 28057 transitions. Word has length 685 [2019-09-07 20:45:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:45:53,000 INFO L475 AbstractCegarLoop]: Abstraction has 17180 states and 28057 transitions. [2019-09-07 20:45:53,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:45:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 17180 states and 28057 transitions. [2019-09-07 20:45:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2019-09-07 20:45:53,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:45:53,031 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:45:53,031 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:45:53,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:45:53,032 INFO L82 PathProgramCache]: Analyzing trace with hash 540592699, now seen corresponding path program 1 times [2019-09-07 20:45:53,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:45:53,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:45:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:53,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:53,793 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 361 proven. 272 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-09-07 20:45:53,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:45:53,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:45:53,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:53,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 20:45:53,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:45:54,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:45:54,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:45:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 646 proven. 41 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 20:45:54,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:45:54,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2019-09-07 20:45:54,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:45:54,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:45:54,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:45:54,910 INFO L87 Difference]: Start difference. First operand 17180 states and 28057 transitions. Second operand 13 states. [2019-09-07 20:46:11,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:11,294 INFO L93 Difference]: Finished difference Result 54577 states and 102492 transitions. [2019-09-07 20:46:11,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 20:46:11,294 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 694 [2019-09-07 20:46:11,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:11,579 INFO L225 Difference]: With dead ends: 54577 [2019-09-07 20:46:11,580 INFO L226 Difference]: Without dead ends: 32666 [2019-09-07 20:46:11,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1042, Invalid=4508, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 20:46:11,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32666 states. [2019-09-07 20:46:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32666 to 28714. [2019-09-07 20:46:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28714 states. [2019-09-07 20:46:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28714 states to 28714 states and 50035 transitions. [2019-09-07 20:46:12,818 INFO L78 Accepts]: Start accepts. Automaton has 28714 states and 50035 transitions. Word has length 694 [2019-09-07 20:46:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:12,819 INFO L475 AbstractCegarLoop]: Abstraction has 28714 states and 50035 transitions. [2019-09-07 20:46:12,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:46:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 28714 states and 50035 transitions. [2019-09-07 20:46:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2019-09-07 20:46:12,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:12,852 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 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] [2019-09-07 20:46:12,852 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:12,852 INFO L82 PathProgramCache]: Analyzing trace with hash 835625647, now seen corresponding path program 1 times [2019-09-07 20:46:12,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:12,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:12,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:12,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:12,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 559 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 20:46:13,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:13,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:46:13,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:13,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:46:13,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2019-09-07 20:46:14,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:46:14,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 20:46:14,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:46:14,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:46:14,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:46:14,557 INFO L87 Difference]: Start difference. First operand 28714 states and 50035 transitions. Second operand 6 states. [2019-09-07 20:46:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:25,349 INFO L93 Difference]: Finished difference Result 74601 states and 128597 transitions. [2019-09-07 20:46:25,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 20:46:25,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 709 [2019-09-07 20:46:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:25,618 INFO L225 Difference]: With dead ends: 74601 [2019-09-07 20:46:25,618 INFO L226 Difference]: Without dead ends: 41494 [2019-09-07 20:46:25,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 714 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:46:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41494 states. [2019-09-07 20:46:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41494 to 39844. [2019-09-07 20:46:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39844 states. [2019-09-07 20:46:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39844 states to 39844 states and 63543 transitions. [2019-09-07 20:46:29,020 INFO L78 Accepts]: Start accepts. Automaton has 39844 states and 63543 transitions. Word has length 709 [2019-09-07 20:46:29,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:29,022 INFO L475 AbstractCegarLoop]: Abstraction has 39844 states and 63543 transitions. [2019-09-07 20:46:29,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:46:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 39844 states and 63543 transitions. [2019-09-07 20:46:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2019-09-07 20:46:29,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:29,121 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 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, 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] [2019-09-07 20:46:29,121 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:29,122 INFO L82 PathProgramCache]: Analyzing trace with hash 704576645, now seen corresponding path program 1 times [2019-09-07 20:46:29,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:29,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:29,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:29,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:29,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-09-07 20:46:29,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:46:29,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:46:29,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:46:29,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:46:29,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:46:29,940 INFO L87 Difference]: Start difference. First operand 39844 states and 63543 transitions. Second operand 3 states. [2019-09-07 20:46:32,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:32,353 INFO L93 Difference]: Finished difference Result 65263 states and 101015 transitions. [2019-09-07 20:46:32,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:46:32,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 754 [2019-09-07 20:46:32,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:32,504 INFO L225 Difference]: With dead ends: 65263 [2019-09-07 20:46:32,504 INFO L226 Difference]: Without dead ends: 26590 [2019-09-07 20:46:32,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:46:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26590 states. [2019-09-07 20:46:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26590 to 23669. [2019-09-07 20:46:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23669 states. [2019-09-07 20:46:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23669 states to 23669 states and 33108 transitions. [2019-09-07 20:46:33,472 INFO L78 Accepts]: Start accepts. Automaton has 23669 states and 33108 transitions. Word has length 754 [2019-09-07 20:46:33,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:33,473 INFO L475 AbstractCegarLoop]: Abstraction has 23669 states and 33108 transitions. [2019-09-07 20:46:33,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:46:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 23669 states and 33108 transitions. [2019-09-07 20:46:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2019-09-07 20:46:33,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:33,533 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:46:33,534 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:33,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:33,534 INFO L82 PathProgramCache]: Analyzing trace with hash 806732530, now seen corresponding path program 1 times [2019-09-07 20:46:33,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:33,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:33,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:33,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:33,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 536 proven. 276 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-09-07 20:46:34,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:34,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:46:34,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:35,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:46:35,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 809 proven. 2 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-09-07 20:46:35,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:46:35,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 20:46:35,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:46:35,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:46:35,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:46:35,831 INFO L87 Difference]: Start difference. First operand 23669 states and 33108 transitions. Second operand 11 states. [2019-09-07 20:46:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:40,924 INFO L93 Difference]: Finished difference Result 40479 states and 52968 transitions. [2019-09-07 20:46:40,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:46:40,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 891 [2019-09-07 20:46:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:40,968 INFO L225 Difference]: With dead ends: 40479 [2019-09-07 20:46:40,969 INFO L226 Difference]: Without dead ends: 17120 [2019-09-07 20:46:41,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 905 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2019-09-07 20:46:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17120 states. [2019-09-07 20:46:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17120 to 12239. [2019-09-07 20:46:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12239 states. [2019-09-07 20:46:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12239 states to 12239 states and 12826 transitions. [2019-09-07 20:46:41,263 INFO L78 Accepts]: Start accepts. Automaton has 12239 states and 12826 transitions. Word has length 891 [2019-09-07 20:46:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:41,264 INFO L475 AbstractCegarLoop]: Abstraction has 12239 states and 12826 transitions. [2019-09-07 20:46:41,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:46:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 12239 states and 12826 transitions. [2019-09-07 20:46:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2019-09-07 20:46:41,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:41,289 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 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] [2019-09-07 20:46:41,289 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:41,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1748063448, now seen corresponding path program 1 times [2019-09-07 20:46:41,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:41,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:41,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1514 backedges. 918 proven. 2 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-09-07 20:46:43,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:43,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:46:43,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:46:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:43,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 1235 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:46:43,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1514 backedges. 918 proven. 2 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-09-07 20:46:43,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:46:43,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 20:46:43,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:46:43,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:46:43,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:46:43,952 INFO L87 Difference]: Start difference. First operand 12239 states and 12826 transitions. Second operand 6 states. [2019-09-07 20:46:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:45,813 INFO L93 Difference]: Finished difference Result 26039 states and 27351 transitions. [2019-09-07 20:46:45,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 20:46:45,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 934 [2019-09-07 20:46:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:45,833 INFO L225 Difference]: With dead ends: 26039 [2019-09-07 20:46:45,834 INFO L226 Difference]: Without dead ends: 14113 [2019-09-07 20:46:45,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 938 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:46:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14113 states. [2019-09-07 20:46:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14113 to 12239. [2019-09-07 20:46:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12239 states. [2019-09-07 20:46:45,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12239 states to 12239 states and 12680 transitions. [2019-09-07 20:46:45,985 INFO L78 Accepts]: Start accepts. Automaton has 12239 states and 12680 transitions. Word has length 934 [2019-09-07 20:46:45,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:45,985 INFO L475 AbstractCegarLoop]: Abstraction has 12239 states and 12680 transitions. [2019-09-07 20:46:45,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:46:45,986 INFO L276 IsEmpty]: Start isEmpty. Operand 12239 states and 12680 transitions. [2019-09-07 20:46:46,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 959 [2019-09-07 20:46:46,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:46,004 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:46:46,004 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:46,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:46,005 INFO L82 PathProgramCache]: Analyzing trace with hash 70761649, now seen corresponding path program 1 times [2019-09-07 20:46:46,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:46,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:46,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:46,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:46,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 876 proven. 2 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2019-09-07 20:46:47,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:47,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:46:47,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:46:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:47,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:46:47,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 876 proven. 2 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2019-09-07 20:46:48,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:46:48,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:46:48,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:46:48,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:46:48,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:46:48,228 INFO L87 Difference]: Start difference. First operand 12239 states and 12680 transitions. Second operand 7 states. [2019-09-07 20:46:50,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:50,636 INFO L93 Difference]: Finished difference Result 26948 states and 27953 transitions. [2019-09-07 20:46:50,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 20:46:50,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 958 [2019-09-07 20:46:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:50,662 INFO L225 Difference]: With dead ends: 26948 [2019-09-07 20:46:50,662 INFO L226 Difference]: Without dead ends: 15022 [2019-09-07 20:46:50,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 970 GetRequests, 960 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:46:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15022 states. [2019-09-07 20:46:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15022 to 13166. [2019-09-07 20:46:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13166 states. [2019-09-07 20:46:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13166 states to 13166 states and 13612 transitions. [2019-09-07 20:46:50,848 INFO L78 Accepts]: Start accepts. Automaton has 13166 states and 13612 transitions. Word has length 958 [2019-09-07 20:46:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:50,850 INFO L475 AbstractCegarLoop]: Abstraction has 13166 states and 13612 transitions. [2019-09-07 20:46:50,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:46:50,850 INFO L276 IsEmpty]: Start isEmpty. Operand 13166 states and 13612 transitions. [2019-09-07 20:46:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2019-09-07 20:46:50,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:50,874 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:46:50,874 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash 637183688, now seen corresponding path program 1 times [2019-09-07 20:46:50,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:50,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:50,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 272 proven. 1014 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-09-07 20:46:52,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:52,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:46:52,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:52,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:46:52,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:52,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:53,245 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 31 [2019-09-07 20:46:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 841 proven. 64 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2019-09-07 20:46:54,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:46:54,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-09-07 20:46:54,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:46:54,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:46:54,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:46:54,359 INFO L87 Difference]: Start difference. First operand 13166 states and 13612 transitions. Second operand 12 states. [2019-09-07 20:47:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:47:04,610 INFO L93 Difference]: Finished difference Result 40497 states and 42298 transitions. [2019-09-07 20:47:04,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 20:47:04,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 983 [2019-09-07 20:47:04,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:47:04,668 INFO L225 Difference]: With dead ends: 40497 [2019-09-07 20:47:04,668 INFO L226 Difference]: Without dead ends: 27331 [2019-09-07 20:47:04,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1019 GetRequests, 995 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2019-09-07 20:47:04,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27331 states. [2019-09-07 20:47:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27331 to 22817. [2019-09-07 20:47:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22817 states. [2019-09-07 20:47:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22817 states to 22817 states and 23600 transitions. [2019-09-07 20:47:05,045 INFO L78 Accepts]: Start accepts. Automaton has 22817 states and 23600 transitions. Word has length 983 [2019-09-07 20:47:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:47:05,046 INFO L475 AbstractCegarLoop]: Abstraction has 22817 states and 23600 transitions. [2019-09-07 20:47:05,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 20:47:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 22817 states and 23600 transitions. [2019-09-07 20:47:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2019-09-07 20:47:05,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:47:05,076 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:47:05,076 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:47:05,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:47:05,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1645362618, now seen corresponding path program 1 times [2019-09-07 20:47:05,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:47:05,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:47:05,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:05,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:47:05,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 15 proven. 269 refuted. 0 times theorem prover too weak. 1491 trivial. 0 not checked. [2019-09-07 20:47:06,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:47:06,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:47:06,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:47:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:06,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 20:47:06,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:47:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 4 proven. 1032 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2019-09-07 20:47:07,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:47:07,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-09-07 20:47:07,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:47:07,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:47:07,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:47:07,811 INFO L87 Difference]: Start difference. First operand 22817 states and 23600 transitions. Second operand 14 states. [2019-09-07 20:47:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:47:14,241 INFO L93 Difference]: Finished difference Result 36730 states and 38394 transitions. [2019-09-07 20:47:14,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 20:47:14,241 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1116 [2019-09-07 20:47:14,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:47:14,293 INFO L225 Difference]: With dead ends: 36730 [2019-09-07 20:47:14,293 INFO L226 Difference]: Without dead ends: 36728 [2019-09-07 20:47:14,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1145 GetRequests, 1117 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=520, Unknown=0, NotChecked=0, Total=756 [2019-09-07 20:47:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36728 states. [2019-09-07 20:47:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36728 to 30952. [2019-09-07 20:47:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30952 states. [2019-09-07 20:47:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30952 states to 30952 states and 32010 transitions. [2019-09-07 20:47:14,639 INFO L78 Accepts]: Start accepts. Automaton has 30952 states and 32010 transitions. Word has length 1116 [2019-09-07 20:47:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:47:14,639 INFO L475 AbstractCegarLoop]: Abstraction has 30952 states and 32010 transitions. [2019-09-07 20:47:14,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:47:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 30952 states and 32010 transitions. [2019-09-07 20:47:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1126 [2019-09-07 20:47:14,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:47:14,669 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:47:14,670 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:47:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:47:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash 48751609, now seen corresponding path program 1 times [2019-09-07 20:47:14,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:47:14,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:47:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:14,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:47:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:47:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:15,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 1049 proven. 64 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2019-09-07 20:47:15,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:47:15,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:47:15,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:47:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:47:15,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 20:47:15,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:47:16,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:47:16,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:47:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 1049 proven. 64 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2019-09-07 20:47:16,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:47:16,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-09-07 20:47:16,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:47:16,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:47:16,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:47:16,621 INFO L87 Difference]: Start difference. First operand 30952 states and 32010 transitions. Second operand 8 states. [2019-09-07 20:47:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:47:20,052 INFO L93 Difference]: Finished difference Result 39311 states and 40682 transitions. [2019-09-07 20:47:20,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:47:20,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1125 [2019-09-07 20:47:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:47:20,054 INFO L225 Difference]: With dead ends: 39311 [2019-09-07 20:47:20,054 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 20:47:20,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1146 GetRequests, 1132 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:47:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 20:47:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 20:47:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 20:47:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 20:47:20,078 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1125 [2019-09-07 20:47:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:47:20,078 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 20:47:20,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:47:20,078 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 20:47:20,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 20:47:20,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 20:47:28,049 WARN L188 SmtUtils]: Spent 4.85 s on a formula simplification. DAG size of input: 1236 DAG size of output: 1027 [2019-09-07 20:47:32,736 WARN L188 SmtUtils]: Spent 4.68 s on a formula simplification. DAG size of input: 1236 DAG size of output: 1027 [2019-09-07 20:47:50,506 WARN L188 SmtUtils]: Spent 16.16 s on a formula simplification. DAG size of input: 964 DAG size of output: 205 [2019-09-07 20:48:06,417 WARN L188 SmtUtils]: Spent 15.86 s on a formula simplification. DAG size of input: 964 DAG size of output: 205 [2019-09-07 20:48:24,413 WARN L188 SmtUtils]: Spent 17.97 s on a formula simplification. DAG size of input: 1029 DAG size of output: 147 [2019-09-07 20:48:42,450 WARN L188 SmtUtils]: Spent 18.03 s on a formula simplification. DAG size of input: 1029 DAG size of output: 147 [2019-09-07 20:48:58,919 WARN L188 SmtUtils]: Spent 16.38 s on a formula simplification. DAG size of input: 985 DAG size of output: 218 [2019-09-07 20:48:58,924 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:48:58,924 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a29~0 |old(~a29~0)|) (= ~a2~0 |old(~a2~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|)) [2019-09-07 20:48:58,924 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:48:58,924 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1658 1758) no Hoare annotation was computed. [2019-09-07 20:48:58,924 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,925 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,925 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1658 1758) the Hoare annotation is: (let ((.cse35 (= 2 |old(~a2~0)|)) (.cse13 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse24 (not (< 0 (+ |old(~a0~0)| 61))))) (let ((.cse12 (= ~a2~0 |old(~a2~0)|)) (.cse8 (= ~a0~0 |old(~a0~0)|)) (.cse27 (= 2 ~a2~0)) (.cse4 (= 4 |old(~a2~0)|)) (.cse23 (and (or .cse35 .cse13) (or .cse13 .cse24))) (.cse20 (not (= 3 |old(~a2~0)|))) (.cse7 (= ~a29~0 |old(~a29~0)|)) (.cse10 (= 3 ~a2~0)) (.cse9 (= ~a4~0 |old(~a4~0)|))) (let ((.cse18 (and .cse7 .cse10 .cse9)) (.cse26 (forall ((v_~a29~0_904 Int)) (let ((.cse38 (mod (+ v_~a29~0_904 16) 29))) (or (not (< v_~a29~0_904 416279)) (not (<= .cse38 (+ |old(~a29~0)| 16))) (= .cse38 0))))) (.cse11 (or .cse23 .cse20)) (.cse29 (not (<= (+ |old(~a0~0)| 44) 0))) (.cse32 (not (<= 0 (+ |old(~a0~0)| 595438)))) (.cse31 (not (<= (+ |old(~a0~0)| 99) 0))) (.cse30 (not (<= 0 (+ |old(~a0~0)| 146)))) (.cse17 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse25 (= 4 ~a2~0)) (.cse22 (not .cse4)) (.cse33 (let ((.cse36 (<= (+ ~a4~0 89) 0)) (.cse37 (<= ~a2~0 |old(~a2~0)|))) (or (and .cse36 .cse37 (not .cse27) .cse9) (and (< 0 (+ ~a0~0 61)) .cse36 .cse37 .cse9)))) (.cse19 (not (<= |old(~a29~0)| 41))) (.cse21 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse15 (and .cse7 .cse27 .cse8 .cse9)) (.cse16 (not .cse35)) (.cse28 (and .cse7 (= 1 ~a2~0) .cse8 .cse9)) (.cse5 (forall ((v_~a0~0_834 Int)) (let ((.cse34 (mod v_~a0~0_834 299926))) (or (= 0 (mod (+ .cse34 2) 5)) (not (< .cse34 599998)) (not (< v_~a0~0_834 0)) (= (mod (+ .cse34 3) 5) 0) (not (< .cse34 300072)) (= 0 .cse34) (not (<= (div (+ .cse34 (- 599998)) 5) (+ |old(~a0~0)| 339336))))))) (.cse14 (not (= 1 |old(~a2~0)|))) (.cse2 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse3 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse1 (not (<= 44 |old(~a29~0)|))) (.cse6 (and .cse7 .cse12 .cse8 .cse9)) (.cse0 (not (<= 4 |old(~a2~0)|)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse1 (and .cse7 .cse8 .cse9 .cse10) .cse11) (or (and .cse8 (and .cse7 .cse12 .cse9)) (or .cse13 .cse14)) (or .cse15 (or .cse13 .cse16) .cse17) (or (and .cse18 .cse8) (or .cse2 .cse3 .cse19 .cse20)) (or .cse15 .cse2 .cse21 .cse1 .cse16 .cse17) (or (or (or .cse22 .cse23) .cse24) (and .cse8 (and .cse7 .cse9 .cse25))) (or (or .cse13 .cse26 .cse16) (and (and .cse7 .cse27 .cse9) .cse8)) (or .cse14 .cse2 .cse21 .cse28 .cse19 .cse29 .cse30) (or .cse15 (or .cse2 .cse21 .cse31 .cse26 .cse16)) (or (or (or .cse2 .cse21 .cse20) .cse31) (and .cse8 .cse18)) (or .cse2 .cse21 .cse19 .cse15 .cse26 .cse16 .cse17) (or .cse15 (or .cse23 .cse16)) (or .cse14 .cse2 .cse21 .cse19 .cse26 .cse32 .cse28) (or (and (and .cse7 .cse12 .cse33) .cse8) (or .cse0 .cse19 .cse26 .cse23)) (or .cse0 .cse2 .cse21 .cse4 .cse17 .cse6) (or (and .cse8 (and .cse7 .cse33 .cse10)) .cse11 .cse29) (or (and (and .cse7 .cse25 .cse9) .cse8) (or .cse22 .cse2 .cse3 .cse21) .cse32) (or .cse23 .cse17 (and .cse7 .cse12 .cse33 .cse8)) (or .cse22 .cse2 .cse21 .cse5 .cse1 (and .cse7 .cse25 .cse8 .cse9) .cse31) (or .cse14 .cse2 .cse21 .cse30 .cse17 .cse28) (or (and (and .cse7 .cse33 .cse25) .cse8) (or .cse22 .cse19 .cse23)) (or (and (and .cse7 (and .cse33 .cse12)) .cse8) (or .cse19 .cse23 .cse20)) (or .cse2 .cse3 .cse21 .cse15 (not (<= 0 (+ |old(~a0~0)| 595423))) .cse16) (or .cse28 .cse5 (or .cse14 .cse2 .cse3)) (or .cse1 .cse6 (or .cse0 .cse23) .cse24))))) [2019-09-07 20:48:58,926 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,926 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,926 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,926 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,926 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,926 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,926 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,926 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-09-07 20:48:58,927 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-09-07 20:48:58,927 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1658 1758) no Hoare annotation was computed. [2019-09-07 20:48:58,927 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,927 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,927 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,927 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,927 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-09-07 20:48:58,927 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-09-07 20:48:58,927 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-09-07 20:48:58,927 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,928 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,928 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,928 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,928 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,928 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,928 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,928 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,928 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-09-07 20:48:58,928 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-09-07 20:48:58,929 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-07 20:48:58,929 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-09-07 20:48:58,929 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-09-07 20:48:58,929 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,929 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,929 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,929 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,929 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,929 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,929 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,930 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,930 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,930 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,930 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-07 20:48:58,930 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-09-07 20:48:58,930 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-09-07 20:48:58,930 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,930 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,930 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,931 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,931 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,931 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,931 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,931 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,931 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,931 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-09-07 20:48:58,931 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,931 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-09-07 20:48:58,932 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,932 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,932 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,932 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-09-07 20:48:58,932 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,932 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-09-07 20:48:58,932 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-09-07 20:48:58,932 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-07 20:48:58,932 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-07 20:48:58,933 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,933 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,933 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,933 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,933 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,933 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,933 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,933 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,933 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,933 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,934 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,934 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-09-07 20:48:58,934 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-07 20:48:58,934 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-09-07 20:48:58,934 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,934 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,934 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-09-07 20:48:58,934 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,934 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-09-07 20:48:58,934 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,935 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,935 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,935 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-09-07 20:48:58,935 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-09-07 20:48:58,935 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,935 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,935 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,935 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,935 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,935 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,936 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,936 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,936 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,936 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-09-07 20:48:58,936 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,936 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-09-07 20:48:58,936 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-09-07 20:48:58,936 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,936 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,937 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,937 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,937 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,937 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,937 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,937 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,937 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,937 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,937 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,938 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,938 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-09-07 20:48:58,938 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,938 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-09-07 20:48:58,938 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-09-07 20:48:58,938 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-09-07 20:48:58,938 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-07 20:48:58,938 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-09-07 20:48:58,938 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-09-07 20:48:58,938 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,938 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,939 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,939 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,939 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,939 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,939 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,939 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,939 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,939 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,939 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,939 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,940 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,940 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,940 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-09-07 20:48:58,940 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,940 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-07 20:48:58,940 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-09-07 20:48:58,940 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,940 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,940 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,941 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,941 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,941 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,941 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,941 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,941 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,941 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,941 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-09-07 20:48:58,941 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-07 20:48:58,941 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,942 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-09-07 20:48:58,942 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,942 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,942 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,942 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-09-07 20:48:58,942 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-09-07 20:48:58,942 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-09-07 20:48:58,942 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-09-07 20:48:58,942 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,943 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1656) the Hoare annotation is: (let ((.cse35 (= 2 |old(~a2~0)|)) (.cse13 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse24 (not (< 0 (+ |old(~a0~0)| 61))))) (let ((.cse12 (= ~a2~0 |old(~a2~0)|)) (.cse8 (= ~a0~0 |old(~a0~0)|)) (.cse27 (= 2 ~a2~0)) (.cse4 (= 4 |old(~a2~0)|)) (.cse23 (and (or .cse35 .cse13) (or .cse13 .cse24))) (.cse20 (not (= 3 |old(~a2~0)|))) (.cse7 (= ~a29~0 |old(~a29~0)|)) (.cse10 (= 3 ~a2~0)) (.cse9 (= ~a4~0 |old(~a4~0)|))) (let ((.cse18 (and .cse7 .cse10 .cse9)) (.cse26 (forall ((v_~a29~0_904 Int)) (let ((.cse38 (mod (+ v_~a29~0_904 16) 29))) (or (not (< v_~a29~0_904 416279)) (not (<= .cse38 (+ |old(~a29~0)| 16))) (= .cse38 0))))) (.cse11 (or .cse23 .cse20)) (.cse29 (not (<= (+ |old(~a0~0)| 44) 0))) (.cse32 (not (<= 0 (+ |old(~a0~0)| 595438)))) (.cse31 (not (<= (+ |old(~a0~0)| 99) 0))) (.cse30 (not (<= 0 (+ |old(~a0~0)| 146)))) (.cse17 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse25 (= 4 ~a2~0)) (.cse22 (not .cse4)) (.cse33 (let ((.cse36 (<= (+ ~a4~0 89) 0)) (.cse37 (<= ~a2~0 |old(~a2~0)|))) (or (and .cse36 .cse37 (not .cse27) .cse9) (and (< 0 (+ ~a0~0 61)) .cse36 .cse37 .cse9)))) (.cse19 (not (<= |old(~a29~0)| 41))) (.cse21 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse15 (and .cse7 .cse27 .cse8 .cse9)) (.cse16 (not .cse35)) (.cse28 (and .cse7 (= 1 ~a2~0) .cse8 .cse9)) (.cse5 (forall ((v_~a0~0_834 Int)) (let ((.cse34 (mod v_~a0~0_834 299926))) (or (= 0 (mod (+ .cse34 2) 5)) (not (< .cse34 599998)) (not (< v_~a0~0_834 0)) (= (mod (+ .cse34 3) 5) 0) (not (< .cse34 300072)) (= 0 .cse34) (not (<= (div (+ .cse34 (- 599998)) 5) (+ |old(~a0~0)| 339336))))))) (.cse14 (not (= 1 |old(~a2~0)|))) (.cse2 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse3 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse1 (not (<= 44 |old(~a29~0)|))) (.cse6 (and .cse7 .cse12 .cse8 .cse9)) (.cse0 (not (<= 4 |old(~a2~0)|)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse1 (and .cse7 .cse8 .cse9 .cse10) .cse11) (or (and .cse8 (and .cse7 .cse12 .cse9)) (or .cse13 .cse14)) (or .cse15 (or .cse13 .cse16) .cse17) (or (and .cse18 .cse8) (or .cse2 .cse3 .cse19 .cse20)) (or .cse15 .cse2 .cse21 .cse1 .cse16 .cse17) (or (or (or .cse22 .cse23) .cse24) (and .cse8 (and .cse7 .cse9 .cse25))) (or (or .cse13 .cse26 .cse16) (and (and .cse7 .cse27 .cse9) .cse8)) (or .cse14 .cse2 .cse21 .cse28 .cse19 .cse29 .cse30) (or .cse15 (or .cse2 .cse21 .cse31 .cse26 .cse16)) (or (or (or .cse2 .cse21 .cse20) .cse31) (and .cse8 .cse18)) (or .cse2 .cse21 .cse19 .cse15 .cse26 .cse16 .cse17) (or .cse15 (or .cse23 .cse16)) (or .cse14 .cse2 .cse21 .cse19 .cse26 .cse32 .cse28) (or (and (and .cse7 .cse12 .cse33) .cse8) (or .cse0 .cse19 .cse26 .cse23)) (or .cse0 .cse2 .cse21 .cse4 .cse17 .cse6) (or (and .cse8 (and .cse7 .cse33 .cse10)) .cse11 .cse29) (or (and (and .cse7 .cse25 .cse9) .cse8) (or .cse22 .cse2 .cse3 .cse21) .cse32) (or .cse23 .cse17 (and .cse7 .cse12 .cse33 .cse8)) (or .cse22 .cse2 .cse21 .cse5 .cse1 (and .cse7 .cse25 .cse8 .cse9) .cse31) (or .cse14 .cse2 .cse21 .cse30 .cse17 .cse28) (or (and (and .cse7 .cse33 .cse25) .cse8) (or .cse22 .cse19 .cse23)) (or (and (and .cse7 (and .cse33 .cse12)) .cse8) (or .cse19 .cse23 .cse20)) (or .cse2 .cse3 .cse21 .cse15 (not (<= 0 (+ |old(~a0~0)| 595423))) .cse16) (or .cse28 .cse5 (or .cse14 .cse2 .cse3)) (or .cse1 .cse6 (or .cse0 .cse23) .cse24))))) [2019-09-07 20:48:58,943 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,943 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,943 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,944 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,944 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,944 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,944 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,944 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,944 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-09-07 20:48:58,944 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-09-07 20:48:58,944 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-09-07 20:48:58,944 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,944 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-09-07 20:48:58,944 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-09-07 20:48:58,945 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,945 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,945 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,945 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,945 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,945 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,945 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,945 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,945 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,945 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,946 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,946 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,946 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,946 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-09-07 20:48:58,946 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-09-07 20:48:58,946 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-09-07 20:48:58,946 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,946 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,946 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,946 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,947 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,947 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,947 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,947 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,947 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,947 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,947 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,947 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-09-07 20:48:58,947 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,947 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-09-07 20:48:58,947 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,948 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-09-07 20:48:58,948 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-09-07 20:48:58,948 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-09-07 20:48:58,948 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,948 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-09-07 20:48:58,948 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-09-07 20:48:58,948 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,948 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-09-07 20:48:58,948 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-09-07 20:48:58,948 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,949 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-09-07 20:48:58,949 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-09-07 20:48:58,949 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,949 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,949 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,949 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,949 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,949 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,949 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,949 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,950 INFO L439 ceAbstractionStarter]: At program point L1655(line 1655) the Hoare annotation is: (let ((.cse37 (= 2 |old(~a2~0)|)) (.cse23 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse34 (not (< 0 (+ |old(~a0~0)| 61)))) (.cse26 (= 2 ~a2~0)) (.cse36 (+ ~a0~0 61)) (.cse12 (= ~a4~0 |old(~a4~0)|))) (let ((.cse21 (= 4 |old(~a2~0)|)) (.cse33 (let ((.cse40 (<= (+ ~a4~0 89) 0)) (.cse41 (<= ~a2~0 |old(~a2~0)|))) (or (and .cse40 .cse41 (not .cse26) .cse12) (and (< 0 .cse36) .cse40 .cse41 .cse12)))) (.cse27 (and (or .cse37 .cse23) (or .cse23 .cse34))) (.cse16 (not (= 3 |old(~a2~0)|))) (.cse32 (= ~a2~0 |old(~a2~0)|)) (.cse18 (= 1 ~a2~0)) (.cse11 (= ~a0~0 |old(~a0~0)|)) (.cse9 (= ~a29~0 |old(~a29~0)|)) (.cse35 (= 3 ~a2~0))) (let ((.cse15 (and .cse9 .cse35 .cse12)) (.cse4 (not (<= (+ |old(~a0~0)| 44) 0))) (.cse5 (not (<= 0 (+ |old(~a0~0)| 146)))) (.cse14 (not (<= (+ |old(~a0~0)| 99) 0))) (.cse24 (forall ((v_~a29~0_904 Int)) (let ((.cse39 (mod (+ v_~a29~0_904 16) 29))) (or (not (< v_~a29~0_904 416279)) (not (<= .cse39 (+ |old(~a29~0)| 16))) (= .cse39 0))))) (.cse6 (and .cse9 .cse18 .cse11 .cse12)) (.cse29 (not (<= 0 (+ |old(~a0~0)| 595438)))) (.cse20 (and .cse9 .cse32 .cse11 .cse12)) (.cse19 (not (<= 4 |old(~a2~0)|))) (.cse8 (forall ((v_~a0~0_834 Int)) (let ((.cse38 (mod v_~a0~0_834 299926))) (or (= 0 (mod (+ .cse38 2) 5)) (not (< .cse38 599998)) (not (< v_~a0~0_834 0)) (= (mod (+ .cse38 3) 5) 0) (not (< .cse38 300072)) (= 0 .cse38) (not (<= (div (+ .cse38 (- 599998)) 5) (+ |old(~a0~0)| 339336))))))) (.cse13 (not (<= 44 |old(~a29~0)|))) (.cse30 (or .cse27 .cse16)) (.cse31 (and .cse9 .cse32 .cse33 .cse11 .cse35)) (.cse22 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse10 (= 4 ~a2~0)) (.cse7 (not .cse21)) (.cse3 (not (<= |old(~a29~0)| 41))) (.cse1 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse17 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse2 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse28 (and .cse9 .cse26 .cse11 .cse12)) (.cse25 (not .cse37)) (.cse0 (not (= 1 |old(~a2~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse1 .cse2 .cse8 (and .cse9 .cse10 .cse11 .cse12) .cse13 .cse14) (or (and .cse11 .cse15) (or (or .cse1 .cse2 .cse16) .cse14)) (or .cse8 (or .cse0 .cse1 .cse17) (and .cse9 (or (<= (+ ~a4~0 86) 0) (not (= 4 calculate_output_~input)) (< 0 (+ ~a29~0 16))) .cse18 .cse11 .cse12)) (or .cse19 .cse20 .cse1 .cse2 .cse21 .cse22) (or (or .cse1 .cse17 .cse3 .cse16) (and .cse15 .cse11)) (or (or .cse23 .cse24 .cse25) (and (and .cse9 .cse26 .cse12) .cse11)) (or (or .cse27 .cse25) .cse28) (or (or .cse7 .cse1 .cse17 .cse2) (and (and .cse9 .cse10 .cse12) .cse11) .cse29) (or .cse28 .cse1 .cse2 .cse3 .cse24 .cse25 .cse22) (or .cse30 .cse31 .cse4) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse22) (or (and .cse9 .cse32 .cse33 .cse11) .cse27 .cse22) (or .cse1 .cse2 .cse13 .cse25 .cse22 .cse28) (or .cse13 (or .cse19 .cse27) .cse34 .cse20) (or .cse28 (or .cse1 .cse2 .cse14 .cse24 .cse25)) (or (or .cse19 .cse3 .cse24 .cse27) (and (and .cse9 (and .cse32 .cse33)) .cse11)) (or (and (and .cse9 .cse12 .cse35) .cse11) (or .cse3 .cse27 .cse16)) (or .cse0 .cse1 .cse2 .cse3 .cse24 .cse6 .cse29) (or .cse20 (or .cse19 .cse13 .cse1 .cse17 .cse21) .cse8) (or .cse13 .cse30 .cse31) (or (or (or .cse7 .cse27) .cse34) (and (and .cse9 .cse12 .cse10) .cse11)) (or (or .cse23 .cse25) .cse22 .cse28) (or (and (and .cse9 .cse33 .cse10) .cse11) (or .cse7 .cse3 .cse27)) (or .cse1 .cse17 .cse2 .cse28 (not (<= 0 (+ |old(~a0~0)| 595423))) .cse25) (or (and .cse11 (and .cse9 .cse32 .cse12 (or (<= .cse36 0) (<= 0 (+ |old(~a29~0)| 143))))) (or .cse23 .cse0)))))) [2019-09-07 20:48:58,951 INFO L443 ceAbstractionStarter]: For program point L1655-1(line 1655) no Hoare annotation was computed. [2019-09-07 20:48:58,951 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,951 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-07 20:48:58,951 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-07 20:48:58,951 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-09-07 20:48:58,951 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2019-09-07 20:48:58,951 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,951 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,951 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,952 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,952 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,952 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,952 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,952 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,952 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,952 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,952 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-09-07 20:48:58,952 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-09-07 20:48:58,953 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,953 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,953 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-09-07 20:48:58,953 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-09-07 20:48:58,953 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-07 20:48:58,953 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,953 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,953 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,953 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-09-07 20:48:58,954 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-09-07 20:48:58,954 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,954 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,954 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,954 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,954 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,954 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,954 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,954 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,955 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,955 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-09-07 20:48:58,955 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-09-07 20:48:58,955 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,955 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,955 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,955 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,955 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,955 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,955 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,956 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-09-07 20:48:58,956 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,956 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-09-07 20:48:58,956 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,956 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-09-07 20:48:58,956 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,956 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-09-07 20:48:58,956 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,957 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-09-07 20:48:58,957 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-07 20:48:58,957 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,957 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,957 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,957 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,957 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,957 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,958 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,958 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,958 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,958 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,958 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,958 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,958 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-07 20:48:58,958 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-09-07 20:48:58,958 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,959 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,959 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,959 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,959 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,959 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,959 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,959 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,959 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,959 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,959 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,959 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-09-07 20:48:58,960 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-09-07 20:48:58,960 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,960 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,960 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-09-07 20:48:58,960 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-09-07 20:48:58,960 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,960 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,960 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,960 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,960 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,960 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,961 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,961 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,961 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,961 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,961 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,961 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,961 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,961 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,961 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-09-07 20:48:58,961 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-09-07 20:48:58,961 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-09-07 20:48:58,962 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,962 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-07 20:48:58,962 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,962 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,962 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,962 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,962 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,962 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,962 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,962 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-09-07 20:48:58,963 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,963 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,963 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,963 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,963 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-09-07 20:48:58,963 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-07 20:48:58,963 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-09-07 20:48:58,963 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,963 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,963 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,964 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,964 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,964 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,964 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,964 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,964 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,964 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,964 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,964 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-09-07 20:48:58,964 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-09-07 20:48:58,964 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,965 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-09-07 20:48:58,965 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,965 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-09-07 20:48:58,965 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,965 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,965 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-07 20:48:58,965 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-09-07 20:48:58,965 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-07 20:48:58,965 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,965 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,966 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,966 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,966 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,966 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,966 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,966 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-09-07 20:48:58,966 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-09-07 20:48:58,966 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-09-07 20:48:58,966 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-09-07 20:48:58,966 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,966 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,967 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,967 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,967 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,967 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,967 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-09-07 20:48:58,967 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-09-07 20:48:58,967 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-09-07 20:48:58,967 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,967 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,967 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,967 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,968 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,968 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-09-07 20:48:58,968 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-09-07 20:48:58,968 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,968 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,968 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,968 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:48:58,968 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-09-07 20:48:58,968 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-09-07 20:48:58,968 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,968 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-09-07 20:48:58,968 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 20:48:58,968 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,969 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-07 20:48:58,969 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,969 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,969 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,969 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,969 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,969 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,969 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-09-07 20:48:58,969 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,969 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-09-07 20:48:58,969 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-09-07 20:48:58,969 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:48:58,969 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~a4~0 89) 0) (= 0 (+ ~a0~0 44)) (= 1 ~a2~0) (= (+ ~a29~0 127) 0)) [2019-09-07 20:48:58,969 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 20:48:58,969 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:48:58,970 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1760 1776) the Hoare annotation is: (let ((.cse0 (+ |old(~a0~0)| 44))) (or (not (= 1 |old(~a2~0)|)) (not (= 0 (+ |old(~a29~0)| 127))) (and (= 1 ~a2~0) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|) (= (+ ~a29~0 127) 0)) (not (<= .cse0 0)) (not (<= (+ |old(~a4~0)| 89) 0)) (not (<= 0 .cse0)))) [2019-09-07 20:48:58,970 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1760 1776) no Hoare annotation was computed. [2019-09-07 20:48:58,970 INFO L439 ceAbstractionStarter]: At program point L1774(line 1774) the Hoare annotation is: (let ((.cse22 (< 0 (+ ~a0~0 61))) (.cse17 (<= (+ ~a4~0 89) 0)) (.cse6 (= 2 ~a2~0))) (let ((.cse16 (= 1 |old(~a2~0)|)) (.cse13 (or (and .cse22 .cse17) (and .cse17 (not .cse6)))) (.cse21 (= 3 ~a2~0))) (let ((.cse8 (and .cse16 .cse13 .cse21)) (.cse18 (<= (+ ~a0~0 44) 0)) (.cse5 (<= (+ ~a0~0 98) 0)) (.cse9 (<= 0 (+ ~a0~0 146))) (.cse2 (= 1 ~a2~0)) (.cse14 (<= 0 (+ ~a0~0 595438))) (.cse11 (<= ~a29~0 41)) (.cse19 (= 4 ~a2~0)) (.cse4 (<= 0 (+ ~a4~0 85))) (.cse15 (<= (+ ~a0~0 99) 0)) (.cse10 (exists ((v_~a29~0_904 Int)) (let ((.cse24 (mod (+ v_~a29~0_904 16) 29))) (and (< v_~a29~0_904 416279) (not (= .cse24 0)) (<= .cse24 (+ ~a29~0 16)))))) (.cse20 (not (= ~a2~0 4))) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse3 (<= (+ ~a0~0 147) 0)) (.cse0 (exists ((v_~a0~0_834 Int)) (let ((.cse23 (mod v_~a0~0_834 299926))) (and (not (= 0 (mod (+ .cse23 2) 5))) (< .cse23 599998) (<= (div (+ .cse23 (- 599998)) 5) (+ ~a0~0 339336)) (< v_~a0~0_834 0) (not (= 0 .cse23)) (not (= (mod (+ .cse23 3) 5) 0)) (< .cse23 300072))))) (.cse7 (<= 44 ~a29~0)) (.cse12 (<= 4 ~a2~0))) (or (and .cse0 (and .cse1 .cse2 .cse3)) (and .cse4 .cse5 .cse6 .cse1 .cse7) (and .cse7 .cse8) (not (= 0 (+ |old(~a0~0)| 44))) (and (and .cse4 .cse5 .cse1 .cse2) .cse9) (and .cse10 .cse11 .cse12 .cse13) (and .cse4 .cse12 .cse3 .cse1 .cse14) (and .cse10 .cse4 .cse6 .cse1 .cse15) (not .cse16) (and .cse10 .cse4 .cse5 .cse11 .cse6 .cse1) (and .cse10 .cse4 .cse11 .cse1 .cse2 .cse14) (and .cse17 .cse5) (and .cse4 .cse11 .cse1 .cse2 .cse9 .cse18) (and .cse11 .cse13 .cse19) (and .cse4 .cse20 .cse12 .cse1 .cse15 (<= ~a29~0 43)) (and .cse8 .cse18) (not (= 0 (+ |old(~a29~0)| 127))) (and .cse4 .cse5 .cse20 .cse12 .cse1 .cse9) (and .cse17 .cse2) (and .cse4 .cse19 .cse7 .cse1 .cse15 .cse14) (and .cse4 .cse3 .cse6 (<= 0 (+ ~a0~0 595423)) .cse1) (and .cse11 .cse1 .cse3 .cse21) (and .cse6 .cse13) (and .cse11 .cse13 .cse21) (and .cse22 (and .cse13 .cse19)) (and .cse4 .cse1 .cse15 .cse21) (and .cse10 .cse17 .cse6) (and (and .cse7 .cse20 .cse1 .cse12 .cse3) .cse0) (not (<= (+ |old(~a4~0)| 89) 0)) (and .cse7 (and .cse12 .cse13) .cse22))))) [2019-09-07 20:48:58,970 INFO L443 ceAbstractionStarter]: For program point L1774-1(line 1774) no Hoare annotation was computed. [2019-09-07 20:48:58,970 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-09-07 20:48:58,970 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse22 (< 0 (+ ~a0~0 61))) (.cse17 (<= (+ ~a4~0 89) 0)) (.cse6 (= 2 ~a2~0))) (let ((.cse16 (= 1 |old(~a2~0)|)) (.cse13 (or (and .cse22 .cse17) (and .cse17 (not .cse6)))) (.cse21 (= 3 ~a2~0))) (let ((.cse8 (and .cse16 .cse13 .cse21)) (.cse18 (<= (+ ~a0~0 44) 0)) (.cse5 (<= (+ ~a0~0 98) 0)) (.cse9 (<= 0 (+ ~a0~0 146))) (.cse2 (= 1 ~a2~0)) (.cse14 (<= 0 (+ ~a0~0 595438))) (.cse11 (<= ~a29~0 41)) (.cse19 (= 4 ~a2~0)) (.cse4 (<= 0 (+ ~a4~0 85))) (.cse15 (<= (+ ~a0~0 99) 0)) (.cse10 (exists ((v_~a29~0_904 Int)) (let ((.cse24 (mod (+ v_~a29~0_904 16) 29))) (and (< v_~a29~0_904 416279) (not (= .cse24 0)) (<= .cse24 (+ ~a29~0 16)))))) (.cse20 (not (= ~a2~0 4))) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse3 (<= (+ ~a0~0 147) 0)) (.cse0 (exists ((v_~a0~0_834 Int)) (let ((.cse23 (mod v_~a0~0_834 299926))) (and (not (= 0 (mod (+ .cse23 2) 5))) (< .cse23 599998) (<= (div (+ .cse23 (- 599998)) 5) (+ ~a0~0 339336)) (< v_~a0~0_834 0) (not (= 0 .cse23)) (not (= (mod (+ .cse23 3) 5) 0)) (< .cse23 300072))))) (.cse7 (<= 44 ~a29~0)) (.cse12 (<= 4 ~a2~0))) (or (and .cse0 (and .cse1 .cse2 .cse3)) (and .cse4 .cse5 .cse6 .cse1 .cse7) (and .cse7 .cse8) (not (= 0 (+ |old(~a0~0)| 44))) (and (and .cse4 .cse5 .cse1 .cse2) .cse9) (and .cse10 .cse11 .cse12 .cse13) (and .cse4 .cse12 .cse3 .cse1 .cse14) (and .cse10 .cse4 .cse6 .cse1 .cse15) (not .cse16) (and .cse10 .cse4 .cse5 .cse11 .cse6 .cse1) (and .cse10 .cse4 .cse11 .cse1 .cse2 .cse14) (and .cse17 .cse5) (and .cse4 .cse11 .cse1 .cse2 .cse9 .cse18) (and .cse11 .cse13 .cse19) (and .cse4 .cse20 .cse12 .cse1 .cse15 (<= ~a29~0 43)) (and .cse8 .cse18) (not (= 0 (+ |old(~a29~0)| 127))) (and .cse4 .cse5 .cse20 .cse12 .cse1 .cse9) (and .cse17 .cse2) (and .cse4 .cse19 .cse7 .cse1 .cse15 .cse14) (and .cse4 .cse3 .cse6 (<= 0 (+ ~a0~0 595423)) .cse1) (and .cse11 .cse1 .cse3 .cse21) (and .cse6 .cse13) (and .cse11 .cse13 .cse21) (and .cse22 (and .cse13 .cse19)) (and .cse4 .cse1 .cse15 .cse21) (and .cse10 .cse17 .cse6) (and (and .cse7 .cse20 .cse1 .cse12 .cse3) .cse0) (not (<= (+ |old(~a4~0)| 89) 0)) (and .cse7 (and .cse12 .cse13) .cse22))))) [2019-09-07 20:48:58,971 INFO L443 ceAbstractionStarter]: For program point L1766-3(lines 1760 1776) no Hoare annotation was computed. [2019-09-07 20:48:58,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:58,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:58,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:58,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:58,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:58,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:58,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:58,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:58,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:58,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:58,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:58,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:58,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:58,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:58,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,006 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,006 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,008 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,008 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,008 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 08:48:59 BoogieIcfgContainer [2019-09-07 20:48:59,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 20:48:59,020 INFO L168 Benchmark]: Toolchain (without parser) took 243948.56 ms. Allocated memory was 134.2 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 85.1 MB in the beginning and 630.1 MB in the end (delta: -545.0 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-07 20:48:59,021 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 20:48:59,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1430.91 ms. Allocated memory was 134.2 MB in the beginning and 202.9 MB in the end (delta: 68.7 MB). Free memory was 84.8 MB in the beginning and 103.2 MB in the end (delta: -18.3 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. [2019-09-07 20:48:59,022 INFO L168 Benchmark]: Boogie Preprocessor took 221.50 ms. Allocated memory is still 202.9 MB. Free memory was 103.2 MB in the beginning and 90.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-09-07 20:48:59,023 INFO L168 Benchmark]: RCFGBuilder took 3340.62 ms. Allocated memory was 202.9 MB in the beginning and 268.4 MB in the end (delta: 65.5 MB). Free memory was 90.5 MB in the beginning and 216.7 MB in the end (delta: -126.2 MB). Peak memory consumption was 81.7 MB. Max. memory is 7.1 GB. [2019-09-07 20:48:59,024 INFO L168 Benchmark]: TraceAbstraction took 238949.23 ms. Allocated memory was 268.4 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 216.6 MB in the beginning and 630.1 MB in the end (delta: -413.5 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-07 20:48:59,027 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.43 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1430.91 ms. Allocated memory was 134.2 MB in the beginning and 202.9 MB in the end (delta: 68.7 MB). Free memory was 84.8 MB in the beginning and 103.2 MB in the end (delta: -18.3 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 221.50 ms. Allocated memory is still 202.9 MB. Free memory was 103.2 MB in the beginning and 90.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3340.62 ms. Allocated memory was 202.9 MB in the beginning and 268.4 MB in the end (delta: 65.5 MB). Free memory was 90.5 MB in the beginning and 216.7 MB in the end (delta: -126.2 MB). Peak memory consumption was 81.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238949.23 ms. Allocated memory was 268.4 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 216.6 MB in the beginning and 630.1 MB in the end (delta: -413.5 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 205]: 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: 1766]: Loop Invariant [2019-09-07 20:48:59,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:48:59,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:48:59,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((\exists v_~a0~0_834 : int :: (((((!(0 == (v_~a0~0_834 % 299926 + 2) % 5) && v_~a0~0_834 % 299926 < 599998) && (v_~a0~0_834 % 299926 + -599998) / 5 <= a0 + 339336) && v_~a0~0_834 < 0) && !(0 == v_~a0~0_834 % 299926)) && !((v_~a0~0_834 % 299926 + 3) % 5 == 0)) && v_~a0~0_834 % 299926 < 300072) && (a4 + 42 <= 0 && 1 == a2) && a0 + 147 <= 0) || ((((0 <= a4 + 85 && a0 + 98 <= 0) && 2 == a2) && a4 + 42 <= 0) && 44 <= a29)) || (44 <= a29 && (1 == \old(a2) && ((0 < a0 + 61 && a4 + 89 <= 0) || (a4 + 89 <= 0 && !(2 == a2)))) && 3 == a2)) || !(0 == \old(a0) + 44)) || ((((0 <= a4 + 85 && a0 + 98 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 146)) || ((((\exists v_~a29~0_904 : int :: (v_~a29~0_904 < 416279 && !((v_~a29~0_904 + 16) % 29 == 0)) && (v_~a29~0_904 + 16) % 29 <= a29 + 16) && a29 <= 41) && 4 <= a2) && ((0 < a0 + 61 && a4 + 89 <= 0) || (a4 + 89 <= 0 && !(2 == a2))))) || ((((0 <= a4 + 85 && 4 <= a2) && a0 + 147 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 595438)) || (((((\exists v_~a29~0_904 : int :: (v_~a29~0_904 < 416279 && !((v_~a29~0_904 + 16) % 29 == 0)) && (v_~a29~0_904 + 16) % 29 <= a29 + 16) && 0 <= a4 + 85) && 2 == a2) && a4 + 42 <= 0) && a0 + 99 <= 0)) || !(1 == \old(a2))) || ((((((\exists v_~a29~0_904 : int :: (v_~a29~0_904 < 416279 && !((v_~a29~0_904 + 16) % 29 == 0)) && (v_~a29~0_904 + 16) % 29 <= a29 + 16) && 0 <= a4 + 85) && a0 + 98 <= 0) && a29 <= 41) && 2 == a2) && a4 + 42 <= 0)) || ((((((\exists v_~a29~0_904 : int :: (v_~a29~0_904 < 416279 && !((v_~a29~0_904 + 16) % 29 == 0)) && (v_~a29~0_904 + 16) % 29 <= a29 + 16) && 0 <= a4 + 85) && a29 <= 41) && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 595438)) || (a4 + 89 <= 0 && a0 + 98 <= 0)) || (((((0 <= a4 + 85 && a29 <= 41) && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 146) && a0 + 44 <= 0)) || ((a29 <= 41 && ((0 < a0 + 61 && a4 + 89 <= 0) || (a4 + 89 <= 0 && !(2 == a2)))) && 4 == a2)) || (((((0 <= a4 + 85 && !(a2 == 4)) && 4 <= a2) && a4 + 42 <= 0) && a0 + 99 <= 0) && a29 <= 43)) || (((1 == \old(a2) && ((0 < a0 + 61 && a4 + 89 <= 0) || (a4 + 89 <= 0 && !(2 == a2)))) && 3 == a2) && a0 + 44 <= 0)) || !(0 == \old(a29) + 127)) || (((((0 <= a4 + 85 && a0 + 98 <= 0) && !(a2 == 4)) && 4 <= a2) && a4 + 42 <= 0) && 0 <= a0 + 146)) || (a4 + 89 <= 0 && 1 == a2)) || (((((0 <= a4 + 85 && 4 == a2) && 44 <= a29) && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 595438)) || ((((0 <= a4 + 85 && a0 + 147 <= 0) && 2 == a2) && 0 <= a0 + 595423) && a4 + 42 <= 0)) || (((a29 <= 41 && a4 + 42 <= 0) && a0 + 147 <= 0) && 3 == a2)) || (2 == a2 && ((0 < a0 + 61 && a4 + 89 <= 0) || (a4 + 89 <= 0 && !(2 == a2))))) || ((a29 <= 41 && ((0 < a0 + 61 && a4 + 89 <= 0) || (a4 + 89 <= 0 && !(2 == a2)))) && 3 == a2)) || (0 < a0 + 61 && ((0 < a0 + 61 && a4 + 89 <= 0) || (a4 + 89 <= 0 && !(2 == a2))) && 4 == a2)) || (((0 <= a4 + 85 && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 == a2)) || (((\exists v_~a29~0_904 : int :: (v_~a29~0_904 < 416279 && !((v_~a29~0_904 + 16) % 29 == 0)) && (v_~a29~0_904 + 16) % 29 <= a29 + 16) && a4 + 89 <= 0) && 2 == a2)) || (((((44 <= a29 && !(a2 == 4)) && a4 + 42 <= 0) && 4 <= a2) && a0 + 147 <= 0) && (\exists v_~a0~0_834 : int :: (((((!(0 == (v_~a0~0_834 % 299926 + 2) % 5) && v_~a0~0_834 % 299926 < 599998) && (v_~a0~0_834 % 299926 + -599998) / 5 <= a0 + 339336) && v_~a0~0_834 < 0) && !(0 == v_~a0~0_834 % 299926)) && !((v_~a0~0_834 % 299926 + 3) % 5 == 0)) && v_~a0~0_834 % 299926 < 300072))) || !(\old(a4) + 89 <= 0)) || ((44 <= a29 && 4 <= a2 && ((0 < a0 + 61 && a4 + 89 <= 0) || (a4 + 89 <= 0 && !(2 == a2)))) && 0 < a0 + 61) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 437 locations, 1 error locations. SAFE Result, 238.8s OverallTime, 17 OverallIterations, 6 TraceHistogramMax, 103.6s AutomataDifference, 0.0s DeadEndRemovalTime, 98.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 2605 SDtfs, 33597 SDslu, 3596 SDs, 0 SdLazy, 62517 SolverSat, 10997 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 78.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10398 GetRequests, 10075 SyntacticMatches, 8 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4286 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39844occurred in iteration=10, 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: 8.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 29287 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 6632 PreInvPairs, 7724 NumberOfFragments, 6314 HoareAnnotationTreeSize, 6632 FomulaSimplifications, 5214057 FormulaSimplificationTreeSizeReduction, 14.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2003130 FormulaSimplificationTreeSizeReductionInter, 84.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 21289 NumberOfCodeBlocks, 21289 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 21259 ConstructedInterpolants, 140 QuantifiedInterpolants, 46564075 SizeOfPredicates, 22 NumberOfNonLiveVariables, 13119 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 24653/28106 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...