/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:13:23,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:13:23,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:13:23,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:13:23,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:13:23,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:13:23,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:13:23,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:13:23,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:13:23,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:13:23,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:13:23,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:13:23,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:13:23,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:13:23,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:13:23,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:13:23,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:13:23,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:13:23,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:13:23,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:13:23,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:13:23,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:13:23,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:13:23,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:13:23,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:13:23,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:13:23,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:13:23,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:13:23,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:13:23,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:13:23,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:13:23,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:13:23,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:13:23,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:13:23,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:13:23,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:13:23,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:13:23,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:13:23,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:13:23,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:13:23,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:13:23,855 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:13:23,868 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:13:23,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:13:23,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:13:23,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:13:23,870 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:13:23,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:13:23,870 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:13:23,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:13:23,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:13:23,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:13:23,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:13:23,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:13:23,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:13:23,871 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:13:23,872 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:13:23,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:13:23,872 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:13:23,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:13:23,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:13:23,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:13:23,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:13:23,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:13:23,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:13:23,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:13:23,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:13:23,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:13:23,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:13:23,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:13:23,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:13:23,874 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:13:24,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:13:24,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:13:24,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:13:24,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:13:24,192 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:13:24,193 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55.c [2019-11-23 21:13:24,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/812c6ed63/ddfa6bfc73bd47c080d3e5b6947fa2c2/FLAG9f28fab8c [2019-11-23 21:13:24,789 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:13:24,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label55.c [2019-11-23 21:13:24,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/812c6ed63/ddfa6bfc73bd47c080d3e5b6947fa2c2/FLAG9f28fab8c [2019-11-23 21:13:25,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/812c6ed63/ddfa6bfc73bd47c080d3e5b6947fa2c2 [2019-11-23 21:13:25,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:13:25,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:13:25,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:13:25,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:13:25,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:13:25,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:13:25" (1/1) ... [2019-11-23 21:13:25,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487d0c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:25, skipping insertion in model container [2019-11-23 21:13:25,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:13:25" (1/1) ... [2019-11-23 21:13:25,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:13:25,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:13:25,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:13:25,723 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:13:25,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:13:25,976 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:13:25,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:25 WrapperNode [2019-11-23 21:13:25,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:13:25,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:13:25,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:13:25,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:13:25,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:25" (1/1) ... [2019-11-23 21:13:26,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:25" (1/1) ... [2019-11-23 21:13:26,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:13:26,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:13:26,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:13:26,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:13:26,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:25" (1/1) ... [2019-11-23 21:13:26,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:25" (1/1) ... [2019-11-23 21:13:26,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:25" (1/1) ... [2019-11-23 21:13:26,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:25" (1/1) ... [2019-11-23 21:13:26,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:25" (1/1) ... [2019-11-23 21:13:26,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:25" (1/1) ... [2019-11-23 21:13:26,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:25" (1/1) ... [2019-11-23 21:13:26,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:13:26,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:13:26,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:13:26,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:13:26,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:13:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:13:26,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:13:27,915 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:13:27,916 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:13:27,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:13:27 BoogieIcfgContainer [2019-11-23 21:13:27,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:13:27,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:13:27,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:13:27,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:13:27,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:13:25" (1/3) ... [2019-11-23 21:13:27,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d92f57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:13:27, skipping insertion in model container [2019-11-23 21:13:27,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:25" (2/3) ... [2019-11-23 21:13:27,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d92f57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:13:27, skipping insertion in model container [2019-11-23 21:13:27,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:13:27" (3/3) ... [2019-11-23 21:13:27,928 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label55.c [2019-11-23 21:13:27,938 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:13:27,947 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:13:27,959 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:13:27,999 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:13:28,000 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:13:28,000 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:13:28,000 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:13:28,000 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:13:28,000 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:13:28,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:13:28,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:13:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-23 21:13:28,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 21:13:28,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:28,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:28,031 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:28,037 INFO L82 PathProgramCache]: Analyzing trace with hash -66916295, now seen corresponding path program 1 times [2019-11-23 21:13:28,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:28,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156220775] [2019-11-23 21:13:28,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:13:28,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156220775] [2019-11-23 21:13:28,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:28,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:13:28,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107131829] [2019-11-23 21:13:28,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:13:28,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:28,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:13:28,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:13:28,484 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 6 states. [2019-11-23 21:13:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:30,600 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2019-11-23 21:13:30,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:13:30,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-23 21:13:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:30,621 INFO L225 Difference]: With dead ends: 852 [2019-11-23 21:13:30,622 INFO L226 Difference]: Without dead ends: 538 [2019-11-23 21:13:30,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:13:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-23 21:13:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-23 21:13:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-23 21:13:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2019-11-23 21:13:30,755 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 57 [2019-11-23 21:13:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:30,757 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2019-11-23 21:13:30,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:13:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2019-11-23 21:13:30,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-23 21:13:30,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:30,764 INFO L410 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, 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] [2019-11-23 21:13:30,765 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:30,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:30,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1784234753, now seen corresponding path program 1 times [2019-11-23 21:13:30,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:30,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205529999] [2019-11-23 21:13:30,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-23 21:13:31,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205529999] [2019-11-23 21:13:31,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:31,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:13:31,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332389235] [2019-11-23 21:13:31,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:13:31,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:31,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:13:31,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:31,023 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand 4 states. [2019-11-23 21:13:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:32,425 INFO L93 Difference]: Finished difference Result 1252 states and 1948 transitions. [2019-11-23 21:13:32,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:13:32,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-11-23 21:13:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:32,431 INFO L225 Difference]: With dead ends: 1252 [2019-11-23 21:13:32,432 INFO L226 Difference]: Without dead ends: 894 [2019-11-23 21:13:32,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:32,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-11-23 21:13:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2019-11-23 21:13:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-11-23 21:13:32,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1206 transitions. [2019-11-23 21:13:32,471 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1206 transitions. Word has length 205 [2019-11-23 21:13:32,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:32,471 INFO L462 AbstractCegarLoop]: Abstraction has 894 states and 1206 transitions. [2019-11-23 21:13:32,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:13:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1206 transitions. [2019-11-23 21:13:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-23 21:13:32,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:32,478 INFO L410 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, 2, 2, 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-11-23 21:13:32,478 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:32,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1832078, now seen corresponding path program 1 times [2019-11-23 21:13:32,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:32,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260910885] [2019-11-23 21:13:32,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:32,831 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 158 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 21:13:32,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260910885] [2019-11-23 21:13:32,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309995151] [2019-11-23 21:13:32,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:32,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:13:32,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-23 21:13:33,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:33,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 21:13:33,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69260445] [2019-11-23 21:13:33,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:13:33,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:33,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:13:33,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:13:33,009 INFO L87 Difference]: Start difference. First operand 894 states and 1206 transitions. Second operand 3 states. [2019-11-23 21:13:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:33,892 INFO L93 Difference]: Finished difference Result 2320 states and 3245 transitions. [2019-11-23 21:13:33,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:33,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-11-23 21:13:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:33,904 INFO L225 Difference]: With dead ends: 2320 [2019-11-23 21:13:33,905 INFO L226 Difference]: Without dead ends: 1606 [2019-11-23 21:13:33,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:13:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-23 21:13:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-11-23 21:13:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-23 21:13:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1842 transitions. [2019-11-23 21:13:33,950 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1842 transitions. Word has length 228 [2019-11-23 21:13:33,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:33,951 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1842 transitions. [2019-11-23 21:13:33,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1842 transitions. [2019-11-23 21:13:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-11-23 21:13:33,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:33,968 INFO L410 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:34,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:34,182 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:34,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:34,183 INFO L82 PathProgramCache]: Analyzing trace with hash -504251555, now seen corresponding path program 1 times [2019-11-23 21:13:34,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:34,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133892297] [2019-11-23 21:13:34,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 266 proven. 4 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-11-23 21:13:34,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133892297] [2019-11-23 21:13:34,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579847301] [2019-11-23 21:13:34,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:34,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 21:13:34,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 282 proven. 43 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-23 21:13:34,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:13:34,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2019-11-23 21:13:34,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549937778] [2019-11-23 21:13:34,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:13:34,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:34,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:13:34,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:34,781 INFO L87 Difference]: Start difference. First operand 1428 states and 1842 transitions. Second operand 8 states. [2019-11-23 21:13:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:38,419 INFO L93 Difference]: Finished difference Result 5238 states and 6957 transitions. [2019-11-23 21:13:38,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 21:13:38,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 327 [2019-11-23 21:13:38,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:38,449 INFO L225 Difference]: With dead ends: 5238 [2019-11-23 21:13:38,449 INFO L226 Difference]: Without dead ends: 3742 [2019-11-23 21:13:38,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:13:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-11-23 21:13:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 2674. [2019-11-23 21:13:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-23 21:13:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2906 transitions. [2019-11-23 21:13:38,551 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2906 transitions. Word has length 327 [2019-11-23 21:13:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:38,552 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2906 transitions. [2019-11-23 21:13:38,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:13:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2906 transitions. [2019-11-23 21:13:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2019-11-23 21:13:38,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:38,578 INFO L410 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-23 21:13:38,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:38,784 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:38,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:38,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1151565879, now seen corresponding path program 1 times [2019-11-23 21:13:38,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:38,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470884795] [2019-11-23 21:13:38,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 645 proven. 4 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-23 21:13:40,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470884795] [2019-11-23 21:13:40,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460171159] [2019-11-23 21:13:40,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:40,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:13:40,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-11-23 21:13:41,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:41,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 21:13:41,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861070655] [2019-11-23 21:13:41,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:13:41,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:41,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:13:41,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:13:41,102 INFO L87 Difference]: Start difference. First operand 2674 states and 2906 transitions. Second operand 3 states. [2019-11-23 21:13:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:41,747 INFO L93 Difference]: Finished difference Result 6236 states and 6841 transitions. [2019-11-23 21:13:41,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:41,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 568 [2019-11-23 21:13:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:41,765 INFO L225 Difference]: With dead ends: 6236 [2019-11-23 21:13:41,765 INFO L226 Difference]: Without dead ends: 3742 [2019-11-23 21:13:41,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:13:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-11-23 21:13:41,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2019-11-23 21:13:41,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-11-23 21:13:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3902 transitions. [2019-11-23 21:13:41,838 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3902 transitions. Word has length 568 [2019-11-23 21:13:41,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:41,839 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 3902 transitions. [2019-11-23 21:13:41,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3902 transitions. [2019-11-23 21:13:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2019-11-23 21:13:41,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:41,857 INFO L410 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, 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, 3, 3, 3, 3, 3, 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] [2019-11-23 21:13:42,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:42,062 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:42,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:42,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1789934183, now seen corresponding path program 1 times [2019-11-23 21:13:42,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:42,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636055194] [2019-11-23 21:13:42,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 761 proven. 4 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-11-23 21:13:43,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636055194] [2019-11-23 21:13:43,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816192877] [2019-11-23 21:13:43,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:43,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:13:43,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2019-11-23 21:13:43,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:43,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 21:13:43,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631660120] [2019-11-23 21:13:43,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:13:43,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:43,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:13:43,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:13:43,583 INFO L87 Difference]: Start difference. First operand 3564 states and 3902 transitions. Second operand 3 states. [2019-11-23 21:13:44,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:44,224 INFO L93 Difference]: Finished difference Result 7660 states and 8407 transitions. [2019-11-23 21:13:44,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:44,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 570 [2019-11-23 21:13:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:44,244 INFO L225 Difference]: With dead ends: 7660 [2019-11-23 21:13:44,244 INFO L226 Difference]: Without dead ends: 4276 [2019-11-23 21:13:44,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:13:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-11-23 21:13:44,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2019-11-23 21:13:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-11-23 21:13:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4470 transitions. [2019-11-23 21:13:44,333 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4470 transitions. Word has length 570 [2019-11-23 21:13:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:44,335 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4470 transitions. [2019-11-23 21:13:44,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4470 transitions. [2019-11-23 21:13:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-11-23 21:13:44,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:44,344 INFO L410 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-23 21:13:44,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:44,553 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:44,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:44,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1934055430, now seen corresponding path program 1 times [2019-11-23 21:13:44,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:44,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379522506] [2019-11-23 21:13:44,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 664 proven. 4 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-23 21:13:45,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379522506] [2019-11-23 21:13:45,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891142456] [2019-11-23 21:13:45,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:46,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:13:46,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:46,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:13:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 645 proven. 23 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-23 21:13:46,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:13:46,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-23 21:13:46,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699712430] [2019-11-23 21:13:46,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:13:46,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:46,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:13:46,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:46,487 INFO L87 Difference]: Start difference. First operand 4098 states and 4470 transitions. Second operand 8 states. [2019-11-23 21:13:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:48,890 INFO L93 Difference]: Finished difference Result 8981 states and 9750 transitions. [2019-11-23 21:13:48,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:13:48,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 582 [2019-11-23 21:13:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:48,926 INFO L225 Difference]: With dead ends: 8981 [2019-11-23 21:13:48,927 INFO L226 Difference]: Without dead ends: 5063 [2019-11-23 21:13:48,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:13:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5063 states. [2019-11-23 21:13:49,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5063 to 4276. [2019-11-23 21:13:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2019-11-23 21:13:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4649 transitions. [2019-11-23 21:13:49,074 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4649 transitions. Word has length 582 [2019-11-23 21:13:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:49,075 INFO L462 AbstractCegarLoop]: Abstraction has 4276 states and 4649 transitions. [2019-11-23 21:13:49,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:13:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4649 transitions. [2019-11-23 21:13:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2019-11-23 21:13:49,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:49,091 INFO L410 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:49,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:49,299 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:49,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1751000691, now seen corresponding path program 1 times [2019-11-23 21:13:49,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:49,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142355818] [2019-11-23 21:13:49,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1367 backedges. 1012 proven. 130 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-23 21:13:50,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142355818] [2019-11-23 21:13:50,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153103664] [2019-11-23 21:13:50,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:50,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:13:50,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1367 backedges. 998 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-23 21:13:51,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:51,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2019-11-23 21:13:51,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759676530] [2019-11-23 21:13:51,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:13:51,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:51,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:13:51,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:13:51,888 INFO L87 Difference]: Start difference. First operand 4276 states and 4649 transitions. Second operand 5 states. [2019-11-23 21:13:53,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:53,072 INFO L93 Difference]: Finished difference Result 8615 states and 9369 transitions. [2019-11-23 21:13:53,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:13:53,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 687 [2019-11-23 21:13:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:53,095 INFO L225 Difference]: With dead ends: 8615 [2019-11-23 21:13:53,095 INFO L226 Difference]: Without dead ends: 4519 [2019-11-23 21:13:53,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 684 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:13:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2019-11-23 21:13:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4454. [2019-11-23 21:13:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-23 21:13:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4821 transitions. [2019-11-23 21:13:53,188 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4821 transitions. Word has length 687 [2019-11-23 21:13:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:53,189 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4821 transitions. [2019-11-23 21:13:53,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:13:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4821 transitions. [2019-11-23 21:13:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-11-23 21:13:53,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:53,200 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:53,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:53,405 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:53,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:53,405 INFO L82 PathProgramCache]: Analyzing trace with hash -94662045, now seen corresponding path program 1 times [2019-11-23 21:13:53,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:53,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069781257] [2019-11-23 21:13:53,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1738 backedges. 1197 proven. 130 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2019-11-23 21:13:54,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069781257] [2019-11-23 21:13:54,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827857007] [2019-11-23 21:13:54,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:54,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:13:54,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1738 backedges. 1100 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-11-23 21:13:55,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:55,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2019-11-23 21:13:55,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643565593] [2019-11-23 21:13:55,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:13:55,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:55,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:13:55,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:13:55,552 INFO L87 Difference]: Start difference. First operand 4454 states and 4821 transitions. Second operand 7 states. [2019-11-23 21:13:56,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:56,422 INFO L93 Difference]: Finished difference Result 8778 states and 9511 transitions. [2019-11-23 21:13:56,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:13:56,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 689 [2019-11-23 21:13:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:56,444 INFO L225 Difference]: With dead ends: 8778 [2019-11-23 21:13:56,444 INFO L226 Difference]: Without dead ends: 4454 [2019-11-23 21:13:56,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 684 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:13:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-11-23 21:13:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 3920. [2019-11-23 21:13:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-23 21:13:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4206 transitions. [2019-11-23 21:13:56,509 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4206 transitions. Word has length 689 [2019-11-23 21:13:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:56,510 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4206 transitions. [2019-11-23 21:13:56,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:13:56,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4206 transitions. [2019-11-23 21:13:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 744 [2019-11-23 21:13:56,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:56,519 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:56,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:56,724 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:56,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:56,724 INFO L82 PathProgramCache]: Analyzing trace with hash 625493994, now seen corresponding path program 1 times [2019-11-23 21:13:56,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:56,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493201599] [2019-11-23 21:13:56,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1763 backedges. 1224 proven. 0 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2019-11-23 21:13:57,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493201599] [2019-11-23 21:13:57,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:57,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:13:57,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680700059] [2019-11-23 21:13:57,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:13:57,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:13:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:13:57,343 INFO L87 Difference]: Start difference. First operand 3920 states and 4206 transitions. Second operand 3 states. [2019-11-23 21:13:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:57,943 INFO L93 Difference]: Finished difference Result 8728 states and 9354 transitions. [2019-11-23 21:13:57,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:57,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 743 [2019-11-23 21:13:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:57,954 INFO L225 Difference]: With dead ends: 8728 [2019-11-23 21:13:57,954 INFO L226 Difference]: Without dead ends: 4988 [2019-11-23 21:13:57,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:13:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-11-23 21:13:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4988. [2019-11-23 21:13:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-11-23 21:13:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5292 transitions. [2019-11-23 21:13:58,026 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5292 transitions. Word has length 743 [2019-11-23 21:13:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:58,027 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5292 transitions. [2019-11-23 21:13:58,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5292 transitions. [2019-11-23 21:13:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2019-11-23 21:13:58,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:58,038 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:58,038 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1172038720, now seen corresponding path program 1 times [2019-11-23 21:13:58,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:58,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302582877] [2019-11-23 21:13:58,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1825 backedges. 1297 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-11-23 21:13:58,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302582877] [2019-11-23 21:13:58,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:58,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:13:58,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476172641] [2019-11-23 21:13:58,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:13:58,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:58,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:13:58,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:58,790 INFO L87 Difference]: Start difference. First operand 4988 states and 5292 transitions. Second operand 4 states. [2019-11-23 21:13:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:59,846 INFO L93 Difference]: Finished difference Result 10508 states and 11192 transitions. [2019-11-23 21:13:59,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:13:59,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 803 [2019-11-23 21:13:59,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:59,858 INFO L225 Difference]: With dead ends: 10508 [2019-11-23 21:13:59,859 INFO L226 Difference]: Without dead ends: 5700 [2019-11-23 21:13:59,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2019-11-23 21:13:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5166. [2019-11-23 21:13:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-11-23 21:13:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5460 transitions. [2019-11-23 21:13:59,937 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5460 transitions. Word has length 803 [2019-11-23 21:13:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:59,938 INFO L462 AbstractCegarLoop]: Abstraction has 5166 states and 5460 transitions. [2019-11-23 21:13:59,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:13:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5460 transitions. [2019-11-23 21:13:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 994 [2019-11-23 21:13:59,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:59,950 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 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, 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-11-23 21:13:59,950 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:59,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:59,951 INFO L82 PathProgramCache]: Analyzing trace with hash -826422406, now seen corresponding path program 1 times [2019-11-23 21:13:59,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:59,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478005974] [2019-11-23 21:13:59,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3089 backedges. 1141 proven. 0 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2019-11-23 21:14:00,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478005974] [2019-11-23 21:14:00,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:14:00,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:14:00,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984932380] [2019-11-23 21:14:00,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:14:00,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:00,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:14:00,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:00,984 INFO L87 Difference]: Start difference. First operand 5166 states and 5460 transitions. Second operand 4 states. [2019-11-23 21:14:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:01,940 INFO L93 Difference]: Finished difference Result 10330 states and 10918 transitions. [2019-11-23 21:14:01,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:14:01,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 993 [2019-11-23 21:14:01,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:01,950 INFO L225 Difference]: With dead ends: 10330 [2019-11-23 21:14:01,950 INFO L226 Difference]: Without dead ends: 5166 [2019-11-23 21:14:01,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-11-23 21:14:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 5166. [2019-11-23 21:14:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-11-23 21:14:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5441 transitions. [2019-11-23 21:14:02,021 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5441 transitions. Word has length 993 [2019-11-23 21:14:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:02,022 INFO L462 AbstractCegarLoop]: Abstraction has 5166 states and 5441 transitions. [2019-11-23 21:14:02,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:14:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5441 transitions. [2019-11-23 21:14:02,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1069 [2019-11-23 21:14:02,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:02,036 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 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, 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, 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-11-23 21:14:02,037 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:02,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:02,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2022978308, now seen corresponding path program 1 times [2019-11-23 21:14:02,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:02,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812129386] [2019-11-23 21:14:02,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 1271 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2019-11-23 21:14:03,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812129386] [2019-11-23 21:14:03,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:14:03,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:14:03,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543672224] [2019-11-23 21:14:03,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:14:03,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:03,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:14:03,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:03,040 INFO L87 Difference]: Start difference. First operand 5166 states and 5441 transitions. Second operand 4 states. [2019-11-23 21:14:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:04,107 INFO L93 Difference]: Finished difference Result 10508 states and 11077 transitions. [2019-11-23 21:14:04,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:14:04,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1068 [2019-11-23 21:14:04,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:04,119 INFO L225 Difference]: With dead ends: 10508 [2019-11-23 21:14:04,119 INFO L226 Difference]: Without dead ends: 5166 [2019-11-23 21:14:04,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-11-23 21:14:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4632. [2019-11-23 21:14:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-23 21:14:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4789 transitions. [2019-11-23 21:14:04,187 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4789 transitions. Word has length 1068 [2019-11-23 21:14:04,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:04,188 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4789 transitions. [2019-11-23 21:14:04,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:14:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4789 transitions. [2019-11-23 21:14:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2019-11-23 21:14:04,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:04,204 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:14:04,205 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:04,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:04,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1857606004, now seen corresponding path program 1 times [2019-11-23 21:14:04,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:04,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119442972] [2019-11-23 21:14:04,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3977 backedges. 1311 proven. 0 refuted. 0 times theorem prover too weak. 2666 trivial. 0 not checked. [2019-11-23 21:14:05,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119442972] [2019-11-23 21:14:05,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:14:05,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:14:05,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666059132] [2019-11-23 21:14:05,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:14:05,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:05,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:14:05,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:14:05,565 INFO L87 Difference]: Start difference. First operand 4632 states and 4789 transitions. Second operand 5 states. [2019-11-23 21:14:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:06,794 INFO L93 Difference]: Finished difference Result 10328 states and 10680 transitions. [2019-11-23 21:14:06,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:14:06,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1116 [2019-11-23 21:14:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:06,797 INFO L225 Difference]: With dead ends: 10328 [2019-11-23 21:14:06,797 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:14:06,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:14:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:14:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:14:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:14:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:14:06,806 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1116 [2019-11-23 21:14:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:06,807 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:14:06,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:14:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:14:06,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:14:06,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:14:07,203 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 177 [2019-11-23 21:14:07,553 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 177 [2019-11-23 21:14:08,253 WARN L192 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 40 [2019-11-23 21:14:08,914 WARN L192 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 40 [2019-11-23 21:14:08,918 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-23 21:14:08,918 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-23 21:14:08,918 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,918 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,918 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,918 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-23 21:14:08,918 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-23 21:14:08,918 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-23 21:14:08,918 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-23 21:14:08,918 INFO L444 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-23 21:14:08,918 INFO L444 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-23 21:14:08,919 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-23 21:14:08,919 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-23 21:14:08,919 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,919 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,919 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,919 INFO L444 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-23 21:14:08,919 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-23 21:14:08,919 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-23 21:14:08,919 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-23 21:14:08,919 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-23 21:14:08,920 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-23 21:14:08,920 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-23 21:14:08,920 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-23 21:14:08,920 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,922 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,922 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,922 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-23 21:14:08,922 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-23 21:14:08,922 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-23 21:14:08,922 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-23 21:14:08,922 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-23 21:14:08,922 INFO L444 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-23 21:14:08,923 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-23 21:14:08,923 INFO L444 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-23 21:14:08,923 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-23 21:14:08,923 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,923 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,923 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,923 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-23 21:14:08,923 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-23 21:14:08,923 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-23 21:14:08,924 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-23 21:14:08,925 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,926 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-23 21:14:08,927 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-23 21:14:08,927 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 21:14:08,927 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-23 21:14:08,927 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-23 21:14:08,927 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-23 21:14:08,927 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-23 21:14:08,927 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-23 21:14:08,927 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-23 21:14:08,927 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,927 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,927 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,927 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-23 21:14:08,927 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-23 21:14:08,928 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-23 21:14:08,928 INFO L444 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-23 21:14:08,928 INFO L444 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-23 21:14:08,928 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-23 21:14:08,928 INFO L444 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-23 21:14:08,928 INFO L444 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-23 21:14:08,928 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,928 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,928 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,929 INFO L444 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-23 21:14:08,929 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-23 21:14:08,929 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-23 21:14:08,929 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-23 21:14:08,929 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-23 21:14:08,929 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-23 21:14:08,929 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 21:14:08,929 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-11-23 21:14:08,929 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-23 21:14:08,929 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-23 21:14:08,929 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,929 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,930 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,930 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-23 21:14:08,930 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-23 21:14:08,930 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-23 21:14:08,930 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-23 21:14:08,930 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-23 21:14:08,930 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-23 21:14:08,930 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-23 21:14:08,931 INFO L444 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-23 21:14:08,931 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,931 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,931 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,931 INFO L444 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-23 21:14:08,931 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-23 21:14:08,931 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-23 21:14:08,931 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-23 21:14:08,931 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-23 21:14:08,931 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-23 21:14:08,932 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-23 21:14:08,932 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-23 21:14:08,932 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,932 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,932 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-23 21:14:08,932 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-23 21:14:08,932 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-23 21:14:08,932 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-23 21:14:08,932 INFO L444 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-23 21:14:08,933 INFO L444 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-23 21:14:08,933 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-23 21:14:08,933 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-23 21:14:08,933 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,933 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,933 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-23 21:14:08,933 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-23 21:14:08,933 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-23 21:14:08,933 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-23 21:14:08,933 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-23 21:14:08,934 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-23 21:14:08,934 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,934 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,935 INFO L440 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse2 (<= ~a12~0 95442)) (.cse3 (not (= ~a15~0 7))) (.cse7 (<= 8 ~a21~0)) (.cse4 (< 80 ~a12~0)) (.cse6 (<= ~a12~0 80)) (.cse0 (= ~a24~0 1)) (.cse5 (<= ~a15~0 8)) (.cse1 (<= ~a21~0 6))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 (= ~a21~0 7) .cse4) (and .cse0 (= ~a21~0 10) .cse5) (and .cse6 .cse0 .cse5) (and .cse7 .cse0 .cse5 .cse2) (and .cse0 .cse7 (<= ~a12~0 11)) (and .cse0 .cse5 (= ~a21~0 9)) (and .cse3 .cse7 .cse0 .cse4) (and .cse6 .cse5 .cse1) (and .cse0 (= ~a21~0 8)) (and .cse0 .cse5 .cse1))) [2019-11-23 21:14:08,936 INFO L444 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-23 21:14:08,936 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-23 21:14:08,936 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-23 21:14:08,936 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-23 21:14:08,936 INFO L444 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-23 21:14:08,936 INFO L444 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-23 21:14:08,936 INFO L444 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-23 21:14:08,936 INFO L444 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-23 21:14:08,936 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,936 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,937 INFO L447 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-23 21:14:08,937 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-23 21:14:08,937 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-23 21:14:08,937 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-23 21:14:08,937 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-23 21:14:08,937 INFO L444 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-23 21:14:08,937 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-23 21:14:08,937 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-23 21:14:08,937 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,937 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,937 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-23 21:14:08,937 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-23 21:14:08,937 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-23 21:14:08,937 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-23 21:14:08,938 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 21:14:08,938 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-23 21:14:08,938 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-23 21:14:08,938 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,938 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,938 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-23 21:14:08,938 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,938 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-23 21:14:08,939 INFO L440 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse2 (<= ~a12~0 95442)) (.cse3 (not (= ~a15~0 7))) (.cse7 (<= 8 ~a21~0)) (.cse4 (< 80 ~a12~0)) (.cse6 (<= ~a12~0 80)) (.cse0 (= ~a24~0 1)) (.cse5 (<= ~a15~0 8)) (.cse1 (<= ~a21~0 6))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 (= ~a21~0 7) .cse4) (and .cse0 (= ~a21~0 10) .cse5) (and .cse6 .cse0 .cse5) (and .cse7 .cse0 .cse5 .cse2) (and .cse0 .cse7 (<= ~a12~0 11)) (and .cse0 .cse5 (= ~a21~0 9)) (and .cse3 .cse7 .cse0 .cse4) (and .cse6 .cse5 .cse1) (and .cse0 (= ~a21~0 8)) (and .cse0 .cse5 .cse1))) [2019-11-23 21:14:08,939 INFO L444 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-23 21:14:08,939 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-23 21:14:08,939 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-23 21:14:08,939 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-23 21:14:08,939 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-23 21:14:08,939 INFO L444 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-23 21:14:08,940 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-23 21:14:08,940 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-23 21:14:08,940 INFO L444 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-23 21:14:08,940 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,940 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,940 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,940 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-23 21:14:08,940 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-23 21:14:08,940 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-23 21:14:08,941 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-23 21:14:08,941 INFO L444 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-23 21:14:08,941 INFO L444 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-23 21:14:08,941 INFO L444 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-23 21:14:08,941 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-23 21:14:08,941 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-23 21:14:08,941 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,941 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,941 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,942 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-23 21:14:08,942 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-23 21:14:08,942 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-23 21:14:08,942 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-23 21:14:08,942 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 21:14:08,942 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-23 21:14:08,942 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-23 21:14:08,942 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-23 21:14:08,942 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-23 21:14:08,942 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,943 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,943 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,943 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-23 21:14:08,943 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-23 21:14:08,943 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-23 21:14:08,943 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-23 21:14:08,943 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-23 21:14:08,943 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-23 21:14:08,943 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-23 21:14:08,943 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-23 21:14:08,943 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-23 21:14:08,944 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,944 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,944 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:08,944 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-23 21:14:08,944 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-23 21:14:08,944 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-23 21:14:08,944 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-23 21:14:08,944 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-23 21:14:08,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:14:08 BoogieIcfgContainer [2019-11-23 21:14:08,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:14:08,975 INFO L168 Benchmark]: Toolchain (without parser) took 43907.84 ms. Allocated memory was 137.4 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 99.9 MB in the beginning and 1.0 GB in the end (delta: -929.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-11-23 21:14:08,975 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 21:14:08,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 911.08 ms. Allocated memory was 137.4 MB in the beginning and 204.5 MB in the end (delta: 67.1 MB). Free memory was 99.7 MB in the beginning and 166.9 MB in the end (delta: -67.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2019-11-23 21:14:08,979 INFO L168 Benchmark]: Boogie Procedure Inliner took 188.25 ms. Allocated memory is still 204.5 MB. Free memory was 166.9 MB in the beginning and 157.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-11-23 21:14:08,980 INFO L168 Benchmark]: Boogie Preprocessor took 133.54 ms. Allocated memory is still 204.5 MB. Free memory was 157.6 MB in the beginning and 150.4 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 7.1 GB. [2019-11-23 21:14:08,980 INFO L168 Benchmark]: RCFGBuilder took 1617.49 ms. Allocated memory was 204.5 MB in the beginning and 235.9 MB in the end (delta: 31.5 MB). Free memory was 150.4 MB in the beginning and 140.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 74.1 MB. Max. memory is 7.1 GB. [2019-11-23 21:14:08,983 INFO L168 Benchmark]: TraceAbstraction took 41052.17 ms. Allocated memory was 235.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 140.5 MB in the beginning and 1.0 GB in the end (delta: -888.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-11-23 21:14:08,990 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 911.08 ms. Allocated memory was 137.4 MB in the beginning and 204.5 MB in the end (delta: 67.1 MB). Free memory was 99.7 MB in the beginning and 166.9 MB in the end (delta: -67.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 188.25 ms. Allocated memory is still 204.5 MB. Free memory was 166.9 MB in the beginning and 157.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.54 ms. Allocated memory is still 204.5 MB. Free memory was 157.6 MB in the beginning and 150.4 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1617.49 ms. Allocated memory was 204.5 MB in the beginning and 235.9 MB in the end (delta: 31.5 MB). Free memory was 150.4 MB in the beginning and 140.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 74.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41052.17 ms. Allocated memory was 235.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 140.5 MB in the beginning and 1.0 GB in the end (delta: -888.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 880]: Loop Invariant Derived loop invariant: (((((((((((a24 == 1 && a21 <= 6) && a12 <= 95442) || (((!(a15 == 7) && a24 == 1) && a21 == 7) && 80 < a12)) || ((a24 == 1 && a21 == 10) && a15 <= 8)) || ((a12 <= 80 && a24 == 1) && a15 <= 8)) || (((8 <= a21 && a24 == 1) && a15 <= 8) && a12 <= 95442)) || ((a24 == 1 && 8 <= a21) && a12 <= 11)) || ((a24 == 1 && a15 <= 8) && a21 == 9)) || (((!(a15 == 7) && 8 <= a21) && a24 == 1) && 80 < a12)) || ((a12 <= 80 && a15 <= 8) && a21 <= 6)) || (a24 == 1 && a21 == 8)) || ((a24 == 1 && a15 <= 8) && a21 <= 6) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((a24 == 1 && a21 <= 6) && a12 <= 95442) || (((!(a15 == 7) && a24 == 1) && a21 == 7) && 80 < a12)) || ((a24 == 1 && a21 == 10) && a15 <= 8)) || ((a12 <= 80 && a24 == 1) && a15 <= 8)) || (((8 <= a21 && a24 == 1) && a15 <= 8) && a12 <= 95442)) || ((a24 == 1 && 8 <= a21) && a12 <= 11)) || ((a24 == 1 && a15 <= 8) && a21 == 9)) || (((!(a15 == 7) && 8 <= a21) && a24 == 1) && 80 < a12)) || ((a12 <= 80 && a15 <= 8) && a21 <= 6)) || (a24 == 1 && a21 == 8)) || ((a24 == 1 && a15 <= 8) && a21 <= 6) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 40.9s, OverallIterations: 14, TraceHistogramMax: 10, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, HoareTripleCheckerStatistics: 1012 SDtfs, 5265 SDslu, 172 SDs, 0 SdLazy, 12974 SolverSat, 2275 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3731 GetRequests, 3650 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5166occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 4056 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 86 NumberOfFragments, 239 HoareAnnotationTreeSize, 3 FomulaSimplifications, 15068 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 8396 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 12287 NumberOfCodeBlocks, 12287 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 12266 ConstructedInterpolants, 0 QuantifiedInterpolants, 23991815 SizeOfPredicates, 18 NumberOfNonLiveVariables, 4566 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 21 InterpolantComputations, 12 PerfectInterpolantSequences, 27460/27806 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...