/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/Problem03_label38.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:56:30,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:56:30,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:56:30,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:56:30,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:56:30,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:56:30,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:56:30,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:56:30,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:56:30,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:56:30,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:56:30,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:56:30,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:56:30,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:56:30,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:56:30,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:56:30,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:56:30,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:56:30,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:56:30,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:56:30,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:56:30,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:56:30,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:56:30,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:56:30,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:56:30,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:56:30,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:56:30,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:56:30,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:56:30,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:56:30,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:56:30,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:56:30,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:56:30,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:56:30,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:56:30,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:56:30,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:56:30,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:56:30,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:56:30,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:56:30,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:56:30,802 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:56:30,823 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:56:30,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:56:30,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:56:30,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:56:30,826 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:56:30,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:56:30,827 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:56:30,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:56:30,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:56:30,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:56:30,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:56:30,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:56:30,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:56:30,829 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:56:30,829 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:56:30,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:56:30,830 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:56:30,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:56:30,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:56:30,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:56:30,831 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:56:30,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:56:30,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:56:30,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:56:30,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:56:30,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:56:30,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:56:30,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:56:30,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:56:30,832 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:56:31,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:56:31,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:56:31,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:56:31,177 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:56:31,178 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:56:31,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label38.c [2019-11-23 20:56:31,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3f16a014/56fb1f8d9ede4c5ebeb7b648b6a1b1a3/FLAG314f4fb78 [2019-11-23 20:56:31,875 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:56:31,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label38.c [2019-11-23 20:56:31,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3f16a014/56fb1f8d9ede4c5ebeb7b648b6a1b1a3/FLAG314f4fb78 [2019-11-23 20:56:32,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3f16a014/56fb1f8d9ede4c5ebeb7b648b6a1b1a3 [2019-11-23 20:56:32,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:56:32,068 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:56:32,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:56:32,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:56:32,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:56:32,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:56:32" (1/1) ... [2019-11-23 20:56:32,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109bcce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:32, skipping insertion in model container [2019-11-23 20:56:32,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:56:32" (1/1) ... [2019-11-23 20:56:32,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:56:32,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:56:32,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:56:32,983 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:56:33,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:56:33,408 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:56:33,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33 WrapperNode [2019-11-23 20:56:33,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:56:33,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:56:33,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:56:33,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:56:33,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:56:33,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:56:33,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:56:33,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:56:33,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... [2019-11-23 20:56:33,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:56:33,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:56:33,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:56:33,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:56:33,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:56:33,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:56:33,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:56:35,874 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:56:35,874 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:56:35,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:56:35 BoogieIcfgContainer [2019-11-23 20:56:35,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:56:35,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:56:35,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:56:35,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:56:35,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:56:32" (1/3) ... [2019-11-23 20:56:35,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df9da1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:56:35, skipping insertion in model container [2019-11-23 20:56:35,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:33" (2/3) ... [2019-11-23 20:56:35,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df9da1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:56:35, skipping insertion in model container [2019-11-23 20:56:35,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:56:35" (3/3) ... [2019-11-23 20:56:35,885 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label38.c [2019-11-23 20:56:35,896 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:56:35,905 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:56:35,918 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:56:35,949 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:56:35,949 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:56:35,949 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:56:35,949 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:56:35,949 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:56:35,950 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:56:35,950 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:56:35,950 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:56:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:56:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-23 20:56:35,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:35,993 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:35,994 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:36,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:36,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1825602715, now seen corresponding path program 1 times [2019-11-23 20:56:36,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:36,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30673060] [2019-11-23 20:56:36,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:36,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30673060] [2019-11-23 20:56:36,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:36,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:56:36,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042554285] [2019-11-23 20:56:36,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:36,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:36,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:36,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:36,775 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-11-23 20:56:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:38,141 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2019-11-23 20:56:38,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:38,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-11-23 20:56:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:38,170 INFO L225 Difference]: With dead ends: 829 [2019-11-23 20:56:38,170 INFO L226 Difference]: Without dead ends: 463 [2019-11-23 20:56:38,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-23 20:56:38,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2019-11-23 20:56:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-23 20:56:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2019-11-23 20:56:38,249 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 201 [2019-11-23 20:56:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:38,250 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2019-11-23 20:56:38,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2019-11-23 20:56:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-23 20:56:38,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:38,257 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:38,257 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:38,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:38,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1178885579, now seen corresponding path program 1 times [2019-11-23 20:56:38,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:38,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917870958] [2019-11-23 20:56:38,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:38,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917870958] [2019-11-23 20:56:38,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:38,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:38,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901345938] [2019-11-23 20:56:38,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:38,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:38,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:38,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:38,448 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand 4 states. [2019-11-23 20:56:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:40,326 INFO L93 Difference]: Finished difference Result 1737 states and 2828 transitions. [2019-11-23 20:56:40,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:40,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-11-23 20:56:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:40,334 INFO L225 Difference]: With dead ends: 1737 [2019-11-23 20:56:40,334 INFO L226 Difference]: Without dead ends: 1290 [2019-11-23 20:56:40,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-11-23 20:56:40,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 859. [2019-11-23 20:56:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-23 20:56:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1316 transitions. [2019-11-23 20:56:40,384 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1316 transitions. Word has length 206 [2019-11-23 20:56:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:40,384 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1316 transitions. [2019-11-23 20:56:40,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1316 transitions. [2019-11-23 20:56:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-23 20:56:40,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:40,399 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:40,399 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1955705264, now seen corresponding path program 1 times [2019-11-23 20:56:40,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:40,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616975365] [2019-11-23 20:56:40,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:40,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616975365] [2019-11-23 20:56:40,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:40,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:40,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028542319] [2019-11-23 20:56:40,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:40,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:40,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:40,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:40,726 INFO L87 Difference]: Start difference. First operand 859 states and 1316 transitions. Second operand 3 states. [2019-11-23 20:56:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:41,918 INFO L93 Difference]: Finished difference Result 2541 states and 3899 transitions. [2019-11-23 20:56:41,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:41,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-11-23 20:56:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:41,927 INFO L225 Difference]: With dead ends: 2541 [2019-11-23 20:56:41,927 INFO L226 Difference]: Without dead ends: 1684 [2019-11-23 20:56:41,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2019-11-23 20:56:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1683. [2019-11-23 20:56:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-11-23 20:56:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2433 transitions. [2019-11-23 20:56:41,969 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2433 transitions. Word has length 208 [2019-11-23 20:56:41,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:41,970 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2433 transitions. [2019-11-23 20:56:41,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2433 transitions. [2019-11-23 20:56:41,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-23 20:56:41,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:41,975 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:41,976 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:41,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash -577423835, now seen corresponding path program 1 times [2019-11-23 20:56:41,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:41,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870421540] [2019-11-23 20:56:41,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:56:42,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870421540] [2019-11-23 20:56:42,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:42,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:56:42,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87442910] [2019-11-23 20:56:42,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:42,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:42,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:42,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:42,058 INFO L87 Difference]: Start difference. First operand 1683 states and 2433 transitions. Second operand 3 states. [2019-11-23 20:56:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:43,095 INFO L93 Difference]: Finished difference Result 4189 states and 6035 transitions. [2019-11-23 20:56:43,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:43,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-23 20:56:43,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:43,108 INFO L225 Difference]: With dead ends: 4189 [2019-11-23 20:56:43,109 INFO L226 Difference]: Without dead ends: 2508 [2019-11-23 20:56:43,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-11-23 20:56:43,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2507. [2019-11-23 20:56:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-11-23 20:56:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3546 transitions. [2019-11-23 20:56:43,167 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3546 transitions. Word has length 216 [2019-11-23 20:56:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:43,167 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 3546 transitions. [2019-11-23 20:56:43,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3546 transitions. [2019-11-23 20:56:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-23 20:56:43,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:43,174 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:43,175 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:43,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:43,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2019535467, now seen corresponding path program 1 times [2019-11-23 20:56:43,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:43,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658710500] [2019-11-23 20:56:43,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 20:56:43,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658710500] [2019-11-23 20:56:43,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:43,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:56:43,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040597133] [2019-11-23 20:56:43,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:43,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:43,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:43,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:43,305 INFO L87 Difference]: Start difference. First operand 2507 states and 3546 transitions. Second operand 3 states. [2019-11-23 20:56:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:43,728 INFO L93 Difference]: Finished difference Result 7497 states and 10609 transitions. [2019-11-23 20:56:43,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:43,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-11-23 20:56:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:43,752 INFO L225 Difference]: With dead ends: 7497 [2019-11-23 20:56:43,753 INFO L226 Difference]: Without dead ends: 4992 [2019-11-23 20:56:43,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:43,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2019-11-23 20:56:43,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 4989. [2019-11-23 20:56:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-11-23 20:56:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 7044 transitions. [2019-11-23 20:56:43,861 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 7044 transitions. Word has length 221 [2019-11-23 20:56:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:43,862 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 7044 transitions. [2019-11-23 20:56:43,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 7044 transitions. [2019-11-23 20:56:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-23 20:56:43,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:43,873 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:43,873 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:43,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1510049729, now seen corresponding path program 1 times [2019-11-23 20:56:43,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:43,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222058128] [2019-11-23 20:56:43,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 20:56:43,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222058128] [2019-11-23 20:56:43,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986257133] [2019-11-23 20:56:43,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:44,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:56:44,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:56:44,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:44,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-23 20:56:44,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938468157] [2019-11-23 20:56:44,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:44,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:44,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:44,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:44,289 INFO L87 Difference]: Start difference. First operand 4989 states and 7044 transitions. Second operand 3 states. [2019-11-23 20:56:44,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:44,715 INFO L93 Difference]: Finished difference Result 14957 states and 21122 transitions. [2019-11-23 20:56:44,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:44,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-23 20:56:44,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:44,763 INFO L225 Difference]: With dead ends: 14957 [2019-11-23 20:56:44,763 INFO L226 Difference]: Without dead ends: 9970 [2019-11-23 20:56:44,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9970 states. [2019-11-23 20:56:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9970 to 9968. [2019-11-23 20:56:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9968 states. [2019-11-23 20:56:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 14047 transitions. [2019-11-23 20:56:45,047 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 14047 transitions. Word has length 230 [2019-11-23 20:56:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:45,047 INFO L462 AbstractCegarLoop]: Abstraction has 9968 states and 14047 transitions. [2019-11-23 20:56:45,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 14047 transitions. [2019-11-23 20:56:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-23 20:56:45,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:45,072 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:45,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:45,292 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:45,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:45,293 INFO L82 PathProgramCache]: Analyzing trace with hash -165449129, now seen corresponding path program 1 times [2019-11-23 20:56:45,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:45,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347279342] [2019-11-23 20:56:45,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:45,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347279342] [2019-11-23 20:56:45,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:45,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:56:45,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577341004] [2019-11-23 20:56:45,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:56:45,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:45,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:56:45,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:56:45,578 INFO L87 Difference]: Start difference. First operand 9968 states and 14047 transitions. Second operand 5 states. [2019-11-23 20:56:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:47,922 INFO L93 Difference]: Finished difference Result 22448 states and 31892 transitions. [2019-11-23 20:56:47,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:56:47,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 239 [2019-11-23 20:56:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:47,963 INFO L225 Difference]: With dead ends: 22448 [2019-11-23 20:56:47,964 INFO L226 Difference]: Without dead ends: 12482 [2019-11-23 20:56:47,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:56:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12482 states. [2019-11-23 20:56:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12482 to 10780. [2019-11-23 20:56:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-23 20:56:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 15197 transitions. [2019-11-23 20:56:48,171 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 15197 transitions. Word has length 239 [2019-11-23 20:56:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:48,171 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 15197 transitions. [2019-11-23 20:56:48,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:56:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 15197 transitions. [2019-11-23 20:56:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-23 20:56:48,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:48,192 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:48,193 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:48,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:48,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2048084382, now seen corresponding path program 1 times [2019-11-23 20:56:48,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:48,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460290627] [2019-11-23 20:56:48,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:56:48,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460290627] [2019-11-23 20:56:48,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:48,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:48,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911727046] [2019-11-23 20:56:48,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:48,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:48,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:48,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:48,304 INFO L87 Difference]: Start difference. First operand 10780 states and 15197 transitions. Second operand 3 states. [2019-11-23 20:56:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:49,517 INFO L93 Difference]: Finished difference Result 21582 states and 30438 transitions. [2019-11-23 20:56:49,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:49,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-11-23 20:56:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:49,539 INFO L225 Difference]: With dead ends: 21582 [2019-11-23 20:56:49,540 INFO L226 Difference]: Without dead ends: 10804 [2019-11-23 20:56:49,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10804 states. [2019-11-23 20:56:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 10780. [2019-11-23 20:56:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-23 20:56:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 14411 transitions. [2019-11-23 20:56:49,719 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 14411 transitions. Word has length 239 [2019-11-23 20:56:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:49,720 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 14411 transitions. [2019-11-23 20:56:49,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 14411 transitions. [2019-11-23 20:56:49,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-23 20:56:49,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:49,738 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:49,738 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:49,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:49,739 INFO L82 PathProgramCache]: Analyzing trace with hash 543919919, now seen corresponding path program 1 times [2019-11-23 20:56:49,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:49,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648949868] [2019-11-23 20:56:49,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-23 20:56:49,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648949868] [2019-11-23 20:56:49,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:49,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:49,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118862295] [2019-11-23 20:56:49,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:49,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:49,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:49,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:49,851 INFO L87 Difference]: Start difference. First operand 10780 states and 14411 transitions. Second operand 4 states. [2019-11-23 20:56:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:51,735 INFO L93 Difference]: Finished difference Result 39482 states and 52679 transitions. [2019-11-23 20:56:51,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:51,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-11-23 20:56:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:51,826 INFO L225 Difference]: With dead ends: 39482 [2019-11-23 20:56:51,826 INFO L226 Difference]: Without dead ends: 28704 [2019-11-23 20:56:51,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28704 states. [2019-11-23 20:56:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28704 to 20132. [2019-11-23 20:56:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20132 states. [2019-11-23 20:56:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 26025 transitions. [2019-11-23 20:56:52,304 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 26025 transitions. Word has length 239 [2019-11-23 20:56:52,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:52,304 INFO L462 AbstractCegarLoop]: Abstraction has 20132 states and 26025 transitions. [2019-11-23 20:56:52,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 26025 transitions. [2019-11-23 20:56:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-23 20:56:52,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:52,351 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:52,351 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:52,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1047521392, now seen corresponding path program 1 times [2019-11-23 20:56:52,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:52,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019941471] [2019-11-23 20:56:52,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 20:56:52,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019941471] [2019-11-23 20:56:52,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:52,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:52,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910434929] [2019-11-23 20:56:52,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:52,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:52,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:52,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:52,515 INFO L87 Difference]: Start difference. First operand 20132 states and 26025 transitions. Second operand 3 states. [2019-11-23 20:56:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:53,953 INFO L93 Difference]: Finished difference Result 55495 states and 71437 transitions. [2019-11-23 20:56:53,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:53,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-11-23 20:56:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:54,015 INFO L225 Difference]: With dead ends: 55495 [2019-11-23 20:56:54,018 INFO L226 Difference]: Without dead ends: 35365 [2019-11-23 20:56:54,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35365 states. [2019-11-23 20:56:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35365 to 35357. [2019-11-23 20:56:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35357 states. [2019-11-23 20:56:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35357 states to 35357 states and 41632 transitions. [2019-11-23 20:56:54,495 INFO L78 Accepts]: Start accepts. Automaton has 35357 states and 41632 transitions. Word has length 245 [2019-11-23 20:56:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:54,495 INFO L462 AbstractCegarLoop]: Abstraction has 35357 states and 41632 transitions. [2019-11-23 20:56:54,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 35357 states and 41632 transitions. [2019-11-23 20:56:54,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-23 20:56:54,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:54,555 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:54,555 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:54,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:54,555 INFO L82 PathProgramCache]: Analyzing trace with hash 195659315, now seen corresponding path program 1 times [2019-11-23 20:56:54,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:54,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448444793] [2019-11-23 20:56:54,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 20:56:54,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448444793] [2019-11-23 20:56:54,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269742556] [2019-11-23 20:56:54,815 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 20:56:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:54,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:56:54,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 20:56:55,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:55,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-23 20:56:55,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941922768] [2019-11-23 20:56:55,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:55,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:55,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:55,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:55,042 INFO L87 Difference]: Start difference. First operand 35357 states and 41632 transitions. Second operand 3 states. [2019-11-23 20:56:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:56,311 INFO L93 Difference]: Finished difference Result 102510 states and 120668 transitions. [2019-11-23 20:56:56,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:56,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-23 20:56:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:56,423 INFO L225 Difference]: With dead ends: 102510 [2019-11-23 20:56:56,424 INFO L226 Difference]: Without dead ends: 67155 [2019-11-23 20:56:56,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:56,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67155 states. [2019-11-23 20:56:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67155 to 67149. [2019-11-23 20:56:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67149 states. [2019-11-23 20:56:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67149 states to 67149 states and 79021 transitions. [2019-11-23 20:56:57,332 INFO L78 Accepts]: Start accepts. Automaton has 67149 states and 79021 transitions. Word has length 269 [2019-11-23 20:56:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:57,332 INFO L462 AbstractCegarLoop]: Abstraction has 67149 states and 79021 transitions. [2019-11-23 20:56:57,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 67149 states and 79021 transitions. [2019-11-23 20:56:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-23 20:56:58,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:58,228 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:58,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:58,432 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:58,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:58,433 INFO L82 PathProgramCache]: Analyzing trace with hash -515489302, now seen corresponding path program 1 times [2019-11-23 20:56:58,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:58,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301210898] [2019-11-23 20:56:58,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:58,568 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 20:56:58,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301210898] [2019-11-23 20:56:58,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:58,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:58,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031102398] [2019-11-23 20:56:58,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:58,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:58,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:58,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:58,570 INFO L87 Difference]: Start difference. First operand 67149 states and 79021 transitions. Second operand 3 states. [2019-11-23 20:57:00,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:00,031 INFO L93 Difference]: Finished difference Result 159671 states and 190266 transitions. [2019-11-23 20:57:00,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:00,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-11-23 20:57:00,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:00,149 INFO L225 Difference]: With dead ends: 159671 [2019-11-23 20:57:00,150 INFO L226 Difference]: Without dead ends: 92524 [2019-11-23 20:57:00,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92524 states. [2019-11-23 20:57:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92524 to 92524. [2019-11-23 20:57:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92524 states. [2019-11-23 20:57:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92524 states to 92524 states and 106045 transitions. [2019-11-23 20:57:01,349 INFO L78 Accepts]: Start accepts. Automaton has 92524 states and 106045 transitions. Word has length 278 [2019-11-23 20:57:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:01,349 INFO L462 AbstractCegarLoop]: Abstraction has 92524 states and 106045 transitions. [2019-11-23 20:57:01,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 92524 states and 106045 transitions. [2019-11-23 20:57:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-11-23 20:57:01,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:01,398 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:01,399 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:01,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:01,399 INFO L82 PathProgramCache]: Analyzing trace with hash 571873565, now seen corresponding path program 1 times [2019-11-23 20:57:01,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:01,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691693401] [2019-11-23 20:57:01,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-23 20:57:01,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691693401] [2019-11-23 20:57:01,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:01,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:01,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411528944] [2019-11-23 20:57:01,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:01,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:01,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:01,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:01,576 INFO L87 Difference]: Start difference. First operand 92524 states and 106045 transitions. Second operand 4 states. [2019-11-23 20:57:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:03,880 INFO L93 Difference]: Finished difference Result 256447 states and 294319 transitions. [2019-11-23 20:57:03,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:03,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 299 [2019-11-23 20:57:03,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:04,030 INFO L225 Difference]: With dead ends: 256447 [2019-11-23 20:57:04,030 INFO L226 Difference]: Without dead ends: 163925 [2019-11-23 20:57:04,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163925 states. [2019-11-23 20:57:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163925 to 126425. [2019-11-23 20:57:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126425 states. [2019-11-23 20:57:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126425 states to 126425 states and 145685 transitions. [2019-11-23 20:57:07,631 INFO L78 Accepts]: Start accepts. Automaton has 126425 states and 145685 transitions. Word has length 299 [2019-11-23 20:57:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:07,631 INFO L462 AbstractCegarLoop]: Abstraction has 126425 states and 145685 transitions. [2019-11-23 20:57:07,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 126425 states and 145685 transitions. [2019-11-23 20:57:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-23 20:57:07,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:07,682 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:07,683 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:07,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1000248581, now seen corresponding path program 1 times [2019-11-23 20:57:07,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:07,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103865808] [2019-11-23 20:57:07,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 20:57:08,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103865808] [2019-11-23 20:57:08,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:08,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:08,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470324273] [2019-11-23 20:57:08,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:08,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:08,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:08,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:08,244 INFO L87 Difference]: Start difference. First operand 126425 states and 145685 transitions. Second operand 3 states. [2019-11-23 20:57:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:09,339 INFO L93 Difference]: Finished difference Result 252840 states and 291360 transitions. [2019-11-23 20:57:09,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:09,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-11-23 20:57:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:09,461 INFO L225 Difference]: With dead ends: 252840 [2019-11-23 20:57:09,461 INFO L226 Difference]: Without dead ends: 126417 [2019-11-23 20:57:09,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126417 states. [2019-11-23 20:57:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126417 to 126417. [2019-11-23 20:57:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126417 states. [2019-11-23 20:57:11,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126417 states to 126417 states and 145661 transitions. [2019-11-23 20:57:11,203 INFO L78 Accepts]: Start accepts. Automaton has 126417 states and 145661 transitions. Word has length 326 [2019-11-23 20:57:11,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:11,204 INFO L462 AbstractCegarLoop]: Abstraction has 126417 states and 145661 transitions. [2019-11-23 20:57:11,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand 126417 states and 145661 transitions. [2019-11-23 20:57:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-11-23 20:57:11,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:11,252 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:11,253 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:11,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:11,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1115478692, now seen corresponding path program 1 times [2019-11-23 20:57:11,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:11,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004667537] [2019-11-23 20:57:11,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-23 20:57:11,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004667537] [2019-11-23 20:57:11,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:11,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:11,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532050212] [2019-11-23 20:57:11,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:11,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:11,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:11,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:11,477 INFO L87 Difference]: Start difference. First operand 126417 states and 145661 transitions. Second operand 3 states. [2019-11-23 20:57:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:14,513 INFO L93 Difference]: Finished difference Result 233377 states and 268997 transitions. [2019-11-23 20:57:14,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:14,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-11-23 20:57:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:14,621 INFO L225 Difference]: With dead ends: 233377 [2019-11-23 20:57:14,621 INFO L226 Difference]: Without dead ends: 106962 [2019-11-23 20:57:14,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:14,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106962 states. [2019-11-23 20:57:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106962 to 60220. [2019-11-23 20:57:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60220 states. [2019-11-23 20:57:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60220 states to 60220 states and 68997 transitions. [2019-11-23 20:57:15,402 INFO L78 Accepts]: Start accepts. Automaton has 60220 states and 68997 transitions. Word has length 327 [2019-11-23 20:57:15,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:15,403 INFO L462 AbstractCegarLoop]: Abstraction has 60220 states and 68997 transitions. [2019-11-23 20:57:15,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:15,403 INFO L276 IsEmpty]: Start isEmpty. Operand 60220 states and 68997 transitions. [2019-11-23 20:57:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-23 20:57:15,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:15,425 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:15,425 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:15,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1143996101, now seen corresponding path program 1 times [2019-11-23 20:57:15,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:15,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892936095] [2019-11-23 20:57:15,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 3 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-23 20:57:15,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892936095] [2019-11-23 20:57:15,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190223064] [2019-11-23 20:57:15,959 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 20:57:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:16,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:57:16,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:57:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-23 20:57:16,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:57:16,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:57:16,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382419231] [2019-11-23 20:57:16,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:16,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:16,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:16,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:57:16,200 INFO L87 Difference]: Start difference. First operand 60220 states and 68997 transitions. Second operand 3 states. [2019-11-23 20:57:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:17,419 INFO L93 Difference]: Finished difference Result 123718 states and 141396 transitions. [2019-11-23 20:57:17,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:17,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-23 20:57:17,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:17,420 INFO L225 Difference]: With dead ends: 123718 [2019-11-23 20:57:17,420 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:57:17,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:57:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:57:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:57:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:57:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:57:17,455 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 332 [2019-11-23 20:57:17,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:17,455 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:57:17,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:57:17,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:57:17,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:57:17,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:57:21,248 WARN L192 SmtUtils]: Spent 3.57 s on a formula simplification. DAG size of input: 1506 DAG size of output: 491 [2019-11-23 20:57:22,833 WARN L192 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 1506 DAG size of output: 491 [2019-11-23 20:57:25,453 WARN L192 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 436 DAG size of output: 55 [2019-11-23 20:57:28,100 WARN L192 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 436 DAG size of output: 55 [2019-11-23 20:57:28,104 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:57:28,104 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:57:28,105 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,105 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,105 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,105 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,105 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,105 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,105 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,105 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-23 20:57:28,105 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,105 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-23 20:57:28,105 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-23 20:57:28,105 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,105 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,106 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,106 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,106 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:57:28,106 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:57:28,106 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,106 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,106 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,106 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,107 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,107 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,107 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,107 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,107 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,107 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,107 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-23 20:57:28,107 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-23 20:57:28,107 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-23 20:57:28,108 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,108 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,108 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,108 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,108 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,108 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,108 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-23 20:57:28,109 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-23 20:57:28,109 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-23 20:57:28,109 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,109 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,109 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,109 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,109 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,109 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,109 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-23 20:57:28,110 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-23 20:57:28,110 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-23 20:57:28,110 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,110 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,110 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,110 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:57:28,110 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,110 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:57:28,110 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,111 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,111 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:57:28,111 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:57:28,111 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,111 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,111 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,111 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,111 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,111 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,112 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,112 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:57:28,112 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:57:28,112 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-23 20:57:28,112 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-23 20:57:28,112 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-23 20:57:28,112 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,112 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,112 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,112 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,113 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,113 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,113 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,113 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,113 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,113 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,113 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-23 20:57:28,113 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-23 20:57:28,113 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-23 20:57:28,113 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,114 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,114 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,114 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,114 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,114 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,114 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,114 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,114 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,115 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-23 20:57:28,115 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-23 20:57:28,115 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-23 20:57:28,115 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:57:28,115 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:57:28,115 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,115 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,115 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,115 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,115 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,116 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:57:28,116 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,116 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,116 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,116 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-23 20:57:28,116 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-23 20:57:28,116 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-23 20:57:28,116 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,116 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,116 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,117 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:57:28,117 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:57:28,117 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,117 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,117 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,117 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:57:28,117 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,117 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:57:28,117 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,117 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-23 20:57:28,118 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,118 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,118 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:57:28,118 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:57:28,118 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:57:28,118 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:57:28,118 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-23 20:57:28,118 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-23 20:57:28,118 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-23 20:57:28,118 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,118 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,118 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,119 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse3 (= ~a12~0 1))) (let ((.cse10 (= 1 ~a3~0)) (.cse4 (= ~a16~0 1)) (.cse12 (= ~a29~0 1)) (.cse8 (<= ~a3~0 0)) (.cse5 (not .cse3)) (.cse11 (= ~a26~0 1)) (.cse0 (= ~a18~0 1)) (.cse1 (= ~a27~0 1)) (.cse2 (= 1 ~a5~0)) (.cse6 (not (= ~a11~0 1))) (.cse9 (not (= 1 ~a6~0))) (.cse7 (<= ~a26~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse2 .cse7 .cse6 .cse9) (and .cse0 .cse2 .cse1 .cse5 .cse6) (and .cse0 .cse2 .cse5 .cse7 .cse9) (and .cse0 .cse10 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse10 .cse2 .cse6 .cse7) (and (<= ~a6~0 0) .cse0 .cse2 .cse11) (and .cse0 .cse2 .cse1 .cse12 .cse9 .cse11) (and .cse0 .cse1 .cse2 .cse6 .cse7 .cse12) (and .cse0 .cse2 .cse5 .cse11) (and .cse0 .cse2 .cse10 .cse6 .cse9) (and .cse8 .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse6 .cse7 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse11) (and .cse0 .cse2 .cse1 .cse5 .cse9) (and .cse0 .cse2 .cse1 .cse5 .cse7) (and .cse0 .cse2 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse6 .cse9 .cse7)))) [2019-11-23 20:57:28,119 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,119 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,119 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,119 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-23 20:57:28,120 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-23 20:57:28,120 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,120 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,120 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:57:28,120 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1638) no Hoare annotation was computed. [2019-11-23 20:57:28,120 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,120 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-23 20:57:28,120 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,120 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,120 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,120 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-23 20:57:28,121 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,122 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,122 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:57:28,122 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:57:28,122 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,122 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse3 (= ~a12~0 1))) (let ((.cse10 (= 1 ~a3~0)) (.cse4 (= ~a16~0 1)) (.cse12 (= ~a29~0 1)) (.cse8 (<= ~a3~0 0)) (.cse5 (not .cse3)) (.cse11 (= ~a26~0 1)) (.cse0 (= ~a18~0 1)) (.cse1 (= ~a27~0 1)) (.cse2 (= 1 ~a5~0)) (.cse6 (not (= ~a11~0 1))) (.cse9 (not (= 1 ~a6~0))) (.cse7 (<= ~a26~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse2 .cse7 .cse6 .cse9) (and .cse0 .cse2 .cse1 .cse5 .cse6) (and .cse0 .cse2 .cse5 .cse7 .cse9) (and .cse0 .cse10 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse10 .cse2 .cse6 .cse7) (and (<= ~a6~0 0) .cse0 .cse2 .cse11) (and .cse0 .cse2 .cse1 .cse12 .cse9 .cse11) (and .cse0 .cse1 .cse2 .cse6 .cse7 .cse12) (and .cse0 .cse2 .cse5 .cse11) (and .cse0 .cse2 .cse10 .cse6 .cse9) (and .cse8 .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse6 .cse7 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse11) (and .cse0 .cse2 .cse1 .cse5 .cse9) (and .cse0 .cse2 .cse1 .cse5 .cse7) (and .cse0 .cse2 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse6 .cse9 .cse7)))) [2019-11-23 20:57:28,122 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,122 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,122 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,122 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,122 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-23 20:57:28,122 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,123 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,124 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,125 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:57:28,126 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:57:28,127 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,127 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-23 20:57:28,127 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-23 20:57:28,127 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-23 20:57:28,127 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,127 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,127 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,127 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,127 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,128 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:57:28,128 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:57:28,128 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,128 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,128 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,128 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-23 20:57:28,128 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-23 20:57:28,128 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,128 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-23 20:57:28,128 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,129 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,129 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,129 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,129 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,129 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,129 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,129 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,129 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,129 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,129 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:57:28,129 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-23 20:57:28,129 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-23 20:57:28,130 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,131 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,131 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,131 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,131 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:28,131 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,131 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-23 20:57:28,131 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-23 20:57:28,131 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,131 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-23 20:57:28,131 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-23 20:57:28,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:57:28 BoogieIcfgContainer [2019-11-23 20:57:28,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:57:28,167 INFO L168 Benchmark]: Toolchain (without parser) took 56100.04 ms. Allocated memory was 137.4 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 97.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-11-23 20:57:28,168 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 20:57:28,169 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1341.00 ms. Allocated memory was 137.4 MB in the beginning and 228.1 MB in the end (delta: 90.7 MB). Free memory was 97.7 MB in the beginning and 176.3 MB in the end (delta: -78.6 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-11-23 20:57:28,169 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.15 ms. Allocated memory is still 228.1 MB. Free memory was 176.3 MB in the beginning and 162.0 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:57:28,170 INFO L168 Benchmark]: Boogie Preprocessor took 124.09 ms. Allocated memory is still 228.1 MB. Free memory was 162.0 MB in the beginning and 150.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:57:28,171 INFO L168 Benchmark]: RCFGBuilder took 2173.66 ms. Allocated memory was 228.1 MB in the beginning and 274.7 MB in the end (delta: 46.7 MB). Free memory was 150.7 MB in the beginning and 199.8 MB in the end (delta: -49.1 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:57:28,171 INFO L168 Benchmark]: TraceAbstraction took 52288.06 ms. Allocated memory was 274.7 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 199.8 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-11-23 20:57:28,176 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1341.00 ms. Allocated memory was 137.4 MB in the beginning and 228.1 MB in the end (delta: 90.7 MB). Free memory was 97.7 MB in the beginning and 176.3 MB in the end (delta: -78.6 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 168.15 ms. Allocated memory is still 228.1 MB. Free memory was 176.3 MB in the beginning and 162.0 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.09 ms. Allocated memory is still 228.1 MB. Free memory was 162.0 MB in the beginning and 150.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2173.66 ms. Allocated memory was 228.1 MB in the beginning and 274.7 MB in the end (delta: 46.7 MB). Free memory was 150.7 MB in the beginning and 199.8 MB in the end (delta: -49.1 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52288.06 ms. Allocated memory was 274.7 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 199.8 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1638]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((a18 == 1 && a27 == 1) && 1 == a5) && a12 == 1) && a16 == 1) || ((((a18 == 1 && 1 == a5) && !(a12 == 1)) && !(a11 == 1)) && a26 <= 0)) || (((((a3 <= 0 && a18 == 1) && 1 == a5) && a26 <= 0) && !(a11 == 1)) && !(1 == a6))) || ((((a18 == 1 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(a11 == 1))) || ((((a18 == 1 && 1 == a5) && !(a12 == 1)) && a26 <= 0) && !(1 == a6))) || (((((a18 == 1 && 1 == a3) && 1 == a5) && a12 == 1) && a26 <= 0) && a16 == 1)) || ((((a18 == 1 && 1 == a3) && 1 == a5) && !(a11 == 1)) && a26 <= 0)) || (((a6 <= 0 && a18 == 1) && 1 == a5) && a26 == 1)) || (((((a18 == 1 && 1 == a5) && a27 == 1) && a29 == 1) && !(1 == a6)) && a26 == 1)) || (((((a18 == 1 && a27 == 1) && 1 == a5) && !(a11 == 1)) && a26 <= 0) && a29 == 1)) || (((a18 == 1 && 1 == a5) && !(a12 == 1)) && a26 == 1)) || ((((a18 == 1 && 1 == a5) && 1 == a3) && !(a11 == 1)) && !(1 == a6))) || (((a3 <= 0 && a18 == 1) && a27 == 1) && 1 == a5)) || ((((a18 == 1 && 1 == a5) && !(a11 == 1)) && a26 <= 0) && a16 == 1)) || ((((a18 == 1 && 1 == a5) && !(a12 == 1)) && !(a11 == 1)) && a29 == 1)) || (((a3 <= 0 && a18 == 1) && 1 == a5) && a26 == 1)) || ((((a18 == 1 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6))) || ((((a18 == 1 && 1 == a5) && a27 == 1) && !(a12 == 1)) && a26 <= 0)) || (((a18 == 1 && 1 == a5) && !(a11 == 1)) && a26 == 1)) || (((((a18 == 1 && a27 == 1) && 1 == a5) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((a18 == 1 && a27 == 1) && 1 == a5) && a12 == 1) && a16 == 1) || ((((a18 == 1 && 1 == a5) && !(a12 == 1)) && !(a11 == 1)) && a26 <= 0)) || (((((a3 <= 0 && a18 == 1) && 1 == a5) && a26 <= 0) && !(a11 == 1)) && !(1 == a6))) || ((((a18 == 1 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(a11 == 1))) || ((((a18 == 1 && 1 == a5) && !(a12 == 1)) && a26 <= 0) && !(1 == a6))) || (((((a18 == 1 && 1 == a3) && 1 == a5) && a12 == 1) && a26 <= 0) && a16 == 1)) || ((((a18 == 1 && 1 == a3) && 1 == a5) && !(a11 == 1)) && a26 <= 0)) || (((a6 <= 0 && a18 == 1) && 1 == a5) && a26 == 1)) || (((((a18 == 1 && 1 == a5) && a27 == 1) && a29 == 1) && !(1 == a6)) && a26 == 1)) || (((((a18 == 1 && a27 == 1) && 1 == a5) && !(a11 == 1)) && a26 <= 0) && a29 == 1)) || (((a18 == 1 && 1 == a5) && !(a12 == 1)) && a26 == 1)) || ((((a18 == 1 && 1 == a5) && 1 == a3) && !(a11 == 1)) && !(1 == a6))) || (((a3 <= 0 && a18 == 1) && a27 == 1) && 1 == a5)) || ((((a18 == 1 && 1 == a5) && !(a11 == 1)) && a26 <= 0) && a16 == 1)) || ((((a18 == 1 && 1 == a5) && !(a12 == 1)) && !(a11 == 1)) && a29 == 1)) || (((a3 <= 0 && a18 == 1) && 1 == a5) && a26 == 1)) || ((((a18 == 1 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6))) || ((((a18 == 1 && 1 == a5) && a27 == 1) && !(a12 == 1)) && a26 <= 0)) || (((a18 == 1 && 1 == a5) && !(a11 == 1)) && a26 == 1)) || (((((a18 == 1 && a27 == 1) && 1 == a5) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 52.1s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 24.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.4s, HoareTripleCheckerStatistics: 3237 SDtfs, 5456 SDslu, 1446 SDs, 0 SdLazy, 9602 SolverSat, 1909 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 879 GetRequests, 846 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126425occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 95006 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 625 NumberOfFragments, 689 HoareAnnotationTreeSize, 3 FomulaSimplifications, 56392 FormulaSimplificationTreeSizeReduction, 5.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 20996 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 4906 NumberOfCodeBlocks, 4906 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4887 ConstructedInterpolants, 0 QuantifiedInterpolants, 2060154 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1556 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 1612/1626 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...