/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_label32.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:56:19,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:56:19,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:56:19,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:56:19,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:56:19,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:56:19,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:56:19,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:56:19,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:56:19,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:56:19,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:56:19,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:56:19,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:56:19,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:56:19,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:56:19,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:56:19,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:56:19,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:56:19,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:56:19,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:56:19,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:56:19,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:56:19,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:56:19,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:56:19,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:56:19,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:56:19,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:56:19,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:56:19,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:56:19,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:56:19,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:56:19,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:56:19,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:56:19,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:56:19,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:56:19,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:56:19,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:56:19,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:56:19,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:56:19,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:56:19,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:56:19,390 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:19,416 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:56:19,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:56:19,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:56:19,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:56:19,421 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:56:19,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:56:19,422 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:56:19,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:56:19,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:56:19,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:56:19,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:56:19,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:56:19,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:56:19,424 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:56:19,424 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:56:19,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:56:19,425 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:56:19,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:56:19,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:56:19,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:56:19,425 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:56:19,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:56:19,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:56:19,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:56:19,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:56:19,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:56:19,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:56:19,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:56:19,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:56:19,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:56:19,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:56:19,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:56:19,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:56:19,704 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:56:19,704 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:56:19,705 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label32.c [2019-11-23 20:56:19,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5d8c709/867094fbb61d46e6bb437f7eb4ee1fa6/FLAGab0e6df8f [2019-11-23 20:56:20,406 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:56:20,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label32.c [2019-11-23 20:56:20,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5d8c709/867094fbb61d46e6bb437f7eb4ee1fa6/FLAGab0e6df8f [2019-11-23 20:56:20,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5d8c709/867094fbb61d46e6bb437f7eb4ee1fa6 [2019-11-23 20:56:20,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:56:20,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:56:20,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:56:20,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:56:20,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:56:20,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:56:20" (1/1) ... [2019-11-23 20:56:20,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9ac29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:20, skipping insertion in model container [2019-11-23 20:56:20,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:56:20" (1/1) ... [2019-11-23 20:56:20,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:56:20,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:56:21,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:56:21,540 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:56:21,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:56:21,926 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:56:21,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:21 WrapperNode [2019-11-23 20:56:21,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:56:21,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:56:21,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:56:21,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:56:21,939 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:21" (1/1) ... [2019-11-23 20:56:21,979 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:21" (1/1) ... [2019-11-23 20:56:22,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:56:22,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:56:22,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:56:22,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:56:22,081 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:21" (1/1) ... [2019-11-23 20:56:22,081 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:21" (1/1) ... [2019-11-23 20:56:22,087 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:21" (1/1) ... [2019-11-23 20:56:22,088 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:21" (1/1) ... [2019-11-23 20:56:22,149 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:21" (1/1) ... [2019-11-23 20:56:22,174 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:21" (1/1) ... [2019-11-23 20:56:22,191 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:21" (1/1) ... [2019-11-23 20:56:22,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:56:22,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:56:22,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:56:22,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:56:22,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:21" (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:22,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:56:22,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:56:24,319 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:56:24,320 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:56:24,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:56:24 BoogieIcfgContainer [2019-11-23 20:56:24,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:56:24,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:56:24,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:56:24,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:56:24,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:56:20" (1/3) ... [2019-11-23 20:56:24,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b139f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:56:24, skipping insertion in model container [2019-11-23 20:56:24,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:21" (2/3) ... [2019-11-23 20:56:24,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b139f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:56:24, skipping insertion in model container [2019-11-23 20:56:24,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:56:24" (3/3) ... [2019-11-23 20:56:24,332 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label32.c [2019-11-23 20:56:24,345 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:56:24,353 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:56:24,369 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:56:24,418 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:56:24,418 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:56:24,418 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:56:24,418 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:56:24,419 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:56:24,420 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:56:24,420 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:56:24,420 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:56:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:56:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-23 20:56:24,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:24,499 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] [2019-11-23 20:56:24,499 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash -570388181, now seen corresponding path program 1 times [2019-11-23 20:56:24,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:24,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191037111] [2019-11-23 20:56:24,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:25,358 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:25,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191037111] [2019-11-23 20:56:25,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:25,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:25,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924869507] [2019-11-23 20:56:25,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:25,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:25,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:25,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:25,391 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-23 20:56:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:27,703 INFO L93 Difference]: Finished difference Result 1075 states and 1929 transitions. [2019-11-23 20:56:27,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:27,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-23 20:56:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:27,729 INFO L225 Difference]: With dead ends: 1075 [2019-11-23 20:56:27,730 INFO L226 Difference]: Without dead ends: 677 [2019-11-23 20:56:27,736 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:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-11-23 20:56:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2019-11-23 20:56:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-23 20:56:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2019-11-23 20:56:27,817 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 189 [2019-11-23 20:56:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:27,818 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2019-11-23 20:56:27,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2019-11-23 20:56:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-23 20:56:27,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:27,822 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,823 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:27,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:27,823 INFO L82 PathProgramCache]: Analyzing trace with hash -811782164, now seen corresponding path program 1 times [2019-11-23 20:56:27,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:27,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403246662] [2019-11-23 20:56:27,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:27,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403246662] [2019-11-23 20:56:27,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:27,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:56:27,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245956436] [2019-11-23 20:56:27,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:27,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:27,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:27,921 INFO L87 Difference]: Start difference. First operand 451 states and 700 transitions. Second operand 3 states. [2019-11-23 20:56:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:29,097 INFO L93 Difference]: Finished difference Result 1323 states and 2069 transitions. [2019-11-23 20:56:29,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:29,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-23 20:56:29,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:29,107 INFO L225 Difference]: With dead ends: 1323 [2019-11-23 20:56:29,108 INFO L226 Difference]: Without dead ends: 874 [2019-11-23 20:56:29,111 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:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-23 20:56:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2019-11-23 20:56:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-23 20:56:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1316 transitions. [2019-11-23 20:56:29,160 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1316 transitions. Word has length 197 [2019-11-23 20:56:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:29,160 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1316 transitions. [2019-11-23 20:56:29,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:29,160 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1316 transitions. [2019-11-23 20:56:29,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-23 20:56:29,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:29,169 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,169 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:29,169 INFO L82 PathProgramCache]: Analyzing trace with hash -104919451, now seen corresponding path program 1 times [2019-11-23 20:56:29,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:29,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293612976] [2019-11-23 20:56:29,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:29,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293612976] [2019-11-23 20:56:29,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:29,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:29,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290252062] [2019-11-23 20:56:29,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:29,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:29,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:29,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:29,263 INFO L87 Difference]: Start difference. First operand 859 states and 1316 transitions. Second operand 4 states. [2019-11-23 20:56:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:30,976 INFO L93 Difference]: Finished difference Result 3364 states and 5170 transitions. [2019-11-23 20:56:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:30,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-23 20:56:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:30,991 INFO L225 Difference]: With dead ends: 3364 [2019-11-23 20:56:30,991 INFO L226 Difference]: Without dead ends: 2507 [2019-11-23 20:56:30,993 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:56:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2019-11-23 20:56:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1682. [2019-11-23 20:56:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-11-23 20:56:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2434 transitions. [2019-11-23 20:56:31,091 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2434 transitions. Word has length 198 [2019-11-23 20:56:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:31,091 INFO L462 AbstractCegarLoop]: Abstraction has 1682 states and 2434 transitions. [2019-11-23 20:56:31,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2434 transitions. [2019-11-23 20:56:31,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-23 20:56:31,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:31,106 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,110 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:31,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:31,110 INFO L82 PathProgramCache]: Analyzing trace with hash 48899105, now seen corresponding path program 1 times [2019-11-23 20:56:31,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:31,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425874426] [2019-11-23 20:56:31,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:56:31,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425874426] [2019-11-23 20:56:31,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:31,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:56:31,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400718908] [2019-11-23 20:56:31,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:31,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:31,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:31,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:31,389 INFO L87 Difference]: Start difference. First operand 1682 states and 2434 transitions. Second operand 4 states. [2019-11-23 20:56:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:33,259 INFO L93 Difference]: Finished difference Result 6614 states and 9588 transitions. [2019-11-23 20:56:33,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:33,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-23 20:56:33,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:33,281 INFO L225 Difference]: With dead ends: 6614 [2019-11-23 20:56:33,281 INFO L226 Difference]: Without dead ends: 4934 [2019-11-23 20:56:33,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:56:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2019-11-23 20:56:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2019-11-23 20:56:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4932 states. [2019-11-23 20:56:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 6537 transitions. [2019-11-23 20:56:33,379 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 6537 transitions. Word has length 204 [2019-11-23 20:56:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:33,380 INFO L462 AbstractCegarLoop]: Abstraction has 4932 states and 6537 transitions. [2019-11-23 20:56:33,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 6537 transitions. [2019-11-23 20:56:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-23 20:56:33,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:33,392 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,393 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:33,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1217776380, now seen corresponding path program 1 times [2019-11-23 20:56:33,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:33,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412369540] [2019-11-23 20:56:33,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:33,514 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:33,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412369540] [2019-11-23 20:56:33,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:33,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:56:33,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970184144] [2019-11-23 20:56:33,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:33,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:33,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:33,517 INFO L87 Difference]: Start difference. First operand 4932 states and 6537 transitions. Second operand 3 states. [2019-11-23 20:56:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:34,646 INFO L93 Difference]: Finished difference Result 11905 states and 15682 transitions. [2019-11-23 20:56:34,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:34,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-23 20:56:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:34,672 INFO L225 Difference]: With dead ends: 11905 [2019-11-23 20:56:34,672 INFO L226 Difference]: Without dead ends: 6975 [2019-11-23 20:56:34,679 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:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6975 states. [2019-11-23 20:56:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6975 to 6974. [2019-11-23 20:56:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6974 states. [2019-11-23 20:56:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 8983 transitions. [2019-11-23 20:56:34,827 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 8983 transitions. Word has length 230 [2019-11-23 20:56:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:34,827 INFO L462 AbstractCegarLoop]: Abstraction has 6974 states and 8983 transitions. [2019-11-23 20:56:34,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 8983 transitions. [2019-11-23 20:56:34,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-23 20:56:34,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:34,846 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, 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] [2019-11-23 20:56:34,846 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:34,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:34,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1656032921, now seen corresponding path program 1 times [2019-11-23 20:56:34,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:34,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340667596] [2019-11-23 20:56:34,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:35,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340667596] [2019-11-23 20:56:35,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962578658] [2019-11-23 20:56:35,105 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:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:35,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:56:35,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:56:35,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:35,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:56:35,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296053894] [2019-11-23 20:56:35,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:35,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:35,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:35,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:35,451 INFO L87 Difference]: Start difference. First operand 6974 states and 8983 transitions. Second operand 3 states. [2019-11-23 20:56:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:36,590 INFO L93 Difference]: Finished difference Result 13963 states and 17998 transitions. [2019-11-23 20:56:36,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:36,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-11-23 20:56:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:36,623 INFO L225 Difference]: With dead ends: 13963 [2019-11-23 20:56:36,623 INFO L226 Difference]: Without dead ends: 6991 [2019-11-23 20:56:36,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 236 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:36,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6991 states. [2019-11-23 20:56:36,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6991 to 6974. [2019-11-23 20:56:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6974 states. [2019-11-23 20:56:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 8848 transitions. [2019-11-23 20:56:36,923 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 8848 transitions. Word has length 237 [2019-11-23 20:56:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:36,924 INFO L462 AbstractCegarLoop]: Abstraction has 6974 states and 8848 transitions. [2019-11-23 20:56:36,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:36,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 8848 transitions. [2019-11-23 20:56:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-23 20:56:36,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:36,948 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:37,153 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1468503162, now seen corresponding path program 1 times [2019-11-23 20:56:37,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:37,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209202749] [2019-11-23 20:56:37,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:37,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209202749] [2019-11-23 20:56:37,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:37,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:37,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315474671] [2019-11-23 20:56:37,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:37,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:37,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:37,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:37,418 INFO L87 Difference]: Start difference. First operand 6974 states and 8848 transitions. Second operand 4 states. [2019-11-23 20:56:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:39,120 INFO L93 Difference]: Finished difference Result 17239 states and 21713 transitions. [2019-11-23 20:56:39,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:39,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-23 20:56:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:39,240 INFO L225 Difference]: With dead ends: 17239 [2019-11-23 20:56:39,240 INFO L226 Difference]: Without dead ends: 10267 [2019-11-23 20:56:39,247 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:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10267 states. [2019-11-23 20:56:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10267 to 8206. [2019-11-23 20:56:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8206 states. [2019-11-23 20:56:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8206 states to 8206 states and 10221 transitions. [2019-11-23 20:56:39,394 INFO L78 Accepts]: Start accepts. Automaton has 8206 states and 10221 transitions. Word has length 252 [2019-11-23 20:56:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:39,394 INFO L462 AbstractCegarLoop]: Abstraction has 8206 states and 10221 transitions. [2019-11-23 20:56:39,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 8206 states and 10221 transitions. [2019-11-23 20:56:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-23 20:56:39,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:39,420 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,420 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:39,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:39,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1641424082, now seen corresponding path program 1 times [2019-11-23 20:56:39,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:39,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696898738] [2019-11-23 20:56:39,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 20:56:39,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696898738] [2019-11-23 20:56:39,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:39,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:39,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71827998] [2019-11-23 20:56:39,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:39,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:39,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:39,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:39,543 INFO L87 Difference]: Start difference. First operand 8206 states and 10221 transitions. Second operand 4 states. [2019-11-23 20:56:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:41,318 INFO L93 Difference]: Finished difference Result 29430 states and 36498 transitions. [2019-11-23 20:56:41,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:41,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-11-23 20:56:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:41,358 INFO L225 Difference]: With dead ends: 29430 [2019-11-23 20:56:41,358 INFO L226 Difference]: Without dead ends: 21226 [2019-11-23 20:56:41,367 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:56:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21226 states. [2019-11-23 20:56:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21226 to 14503. [2019-11-23 20:56:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14503 states. [2019-11-23 20:56:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14503 states to 14503 states and 17335 transitions. [2019-11-23 20:56:41,579 INFO L78 Accepts]: Start accepts. Automaton has 14503 states and 17335 transitions. Word has length 254 [2019-11-23 20:56:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:41,580 INFO L462 AbstractCegarLoop]: Abstraction has 14503 states and 17335 transitions. [2019-11-23 20:56:41,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 14503 states and 17335 transitions. [2019-11-23 20:56:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-11-23 20:56:41,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:41,613 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 20:56:41,613 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:41,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:41,614 INFO L82 PathProgramCache]: Analyzing trace with hash -590016379, now seen corresponding path program 1 times [2019-11-23 20:56:41,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:41,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081147190] [2019-11-23 20:56:41,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-23 20:56:41,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081147190] [2019-11-23 20:56:41,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454503007] [2019-11-23 20:56:41,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 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:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:42,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:56:42,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:56:42,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:42,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:56:42,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275240327] [2019-11-23 20:56:42,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:42,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:42,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:42,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:42,435 INFO L87 Difference]: Start difference. First operand 14503 states and 17335 transitions. Second operand 3 states. [2019-11-23 20:56:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:42,994 INFO L93 Difference]: Finished difference Result 28767 states and 34387 transitions. [2019-11-23 20:56:42,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:42,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-11-23 20:56:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:43,020 INFO L225 Difference]: With dead ends: 28767 [2019-11-23 20:56:43,021 INFO L226 Difference]: Without dead ends: 14266 [2019-11-23 20:56:43,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 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:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14266 states. [2019-11-23 20:56:43,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14266 to 13251. [2019-11-23 20:56:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-23 20:56:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 15809 transitions. [2019-11-23 20:56:43,213 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 15809 transitions. Word has length 330 [2019-11-23 20:56:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:43,214 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 15809 transitions. [2019-11-23 20:56:43,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 15809 transitions. [2019-11-23 20:56:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-11-23 20:56:43,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:43,252 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 20:56:43,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:43,456 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash 106936724, now seen corresponding path program 1 times [2019-11-23 20:56:43,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:43,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619173060] [2019-11-23 20:56:43,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-23 20:56:44,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619173060] [2019-11-23 20:56:44,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039931754] [2019-11-23 20:56:44,339 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:56:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:44,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:56:44,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:56:44,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:44,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:56:44,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517597309] [2019-11-23 20:56:44,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:44,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:44,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:44,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:44,806 INFO L87 Difference]: Start difference. First operand 13251 states and 15809 transitions. Second operand 3 states. [2019-11-23 20:56:45,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:45,950 INFO L93 Difference]: Finished difference Result 26503 states and 31621 transitions. [2019-11-23 20:56:45,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:45,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2019-11-23 20:56:45,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:45,971 INFO L225 Difference]: With dead ends: 26503 [2019-11-23 20:56:45,971 INFO L226 Difference]: Without dead ends: 13254 [2019-11-23 20:56:45,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:45,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13254 states. [2019-11-23 20:56:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13254 to 13251. [2019-11-23 20:56:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-23 20:56:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 15155 transitions. [2019-11-23 20:56:46,146 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 15155 transitions. Word has length 346 [2019-11-23 20:56:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:46,147 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 15155 transitions. [2019-11-23 20:56:46,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 15155 transitions. [2019-11-23 20:56:46,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-11-23 20:56:46,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:46,179 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:46,449 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:46,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1570706907, now seen corresponding path program 1 times [2019-11-23 20:56:46,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:46,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384301107] [2019-11-23 20:56:46,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:46,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384301107] [2019-11-23 20:56:46,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:46,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:46,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743873488] [2019-11-23 20:56:46,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:46,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:46,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:46,744 INFO L87 Difference]: Start difference. First operand 13251 states and 15155 transitions. Second operand 3 states. [2019-11-23 20:56:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:47,765 INFO L93 Difference]: Finished difference Result 26501 states and 30310 transitions. [2019-11-23 20:56:47,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:47,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 394 [2019-11-23 20:56:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:47,784 INFO L225 Difference]: With dead ends: 26501 [2019-11-23 20:56:47,784 INFO L226 Difference]: Without dead ends: 13252 [2019-11-23 20:56:47,795 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:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13252 states. [2019-11-23 20:56:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13252 to 13251. [2019-11-23 20:56:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-23 20:56:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 14735 transitions. [2019-11-23 20:56:47,925 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 14735 transitions. Word has length 394 [2019-11-23 20:56:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:47,925 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 14735 transitions. [2019-11-23 20:56:47,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 14735 transitions. [2019-11-23 20:56:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-23 20:56:47,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:47,940 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,941 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:47,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:47,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1164857076, now seen corresponding path program 1 times [2019-11-23 20:56:47,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:47,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181991746] [2019-11-23 20:56:47,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-23 20:56:48,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181991746] [2019-11-23 20:56:48,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:48,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:48,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571709750] [2019-11-23 20:56:48,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:48,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:48,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:48,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:48,253 INFO L87 Difference]: Start difference. First operand 13251 states and 14735 transitions. Second operand 3 states. [2019-11-23 20:56:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:49,216 INFO L93 Difference]: Finished difference Result 26300 states and 29259 transitions. [2019-11-23 20:56:49,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:49,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 421 [2019-11-23 20:56:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:49,232 INFO L225 Difference]: With dead ends: 26300 [2019-11-23 20:56:49,233 INFO L226 Difference]: Without dead ends: 13051 [2019-11-23 20:56:49,241 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,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13051 states. [2019-11-23 20:56:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13051 to 12439. [2019-11-23 20:56:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12439 states. [2019-11-23 20:56:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12439 states to 12439 states and 13550 transitions. [2019-11-23 20:56:49,368 INFO L78 Accepts]: Start accepts. Automaton has 12439 states and 13550 transitions. Word has length 421 [2019-11-23 20:56:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:49,368 INFO L462 AbstractCegarLoop]: Abstraction has 12439 states and 13550 transitions. [2019-11-23 20:56:49,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 12439 states and 13550 transitions. [2019-11-23 20:56:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-11-23 20:56:49,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:49,381 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 20:56:49,381 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:49,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1167417895, now seen corresponding path program 1 times [2019-11-23 20:56:49,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:49,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040945147] [2019-11-23 20:56:49,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-11-23 20:56:49,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040945147] [2019-11-23 20:56:49,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:49,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:49,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102449336] [2019-11-23 20:56:49,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:49,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:49,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:49,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:49,723 INFO L87 Difference]: Start difference. First operand 12439 states and 13550 transitions. Second operand 3 states. [2019-11-23 20:56:50,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:50,752 INFO L93 Difference]: Finished difference Result 29966 states and 32694 transitions. [2019-11-23 20:56:50,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:50,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2019-11-23 20:56:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:50,770 INFO L225 Difference]: With dead ends: 29966 [2019-11-23 20:56:50,770 INFO L226 Difference]: Without dead ends: 17529 [2019-11-23 20:56:50,780 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:50,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17529 states. [2019-11-23 20:56:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17529 to 13657. [2019-11-23 20:56:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13657 states. [2019-11-23 20:56:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13657 states to 13657 states and 14892 transitions. [2019-11-23 20:56:50,953 INFO L78 Accepts]: Start accepts. Automaton has 13657 states and 14892 transitions. Word has length 443 [2019-11-23 20:56:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:50,954 INFO L462 AbstractCegarLoop]: Abstraction has 13657 states and 14892 transitions. [2019-11-23 20:56:50,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 13657 states and 14892 transitions. [2019-11-23 20:56:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-11-23 20:56:50,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:50,968 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,968 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:50,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:50,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1549945789, now seen corresponding path program 1 times [2019-11-23 20:56:50,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:50,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79500133] [2019-11-23 20:56:50,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 263 proven. 14 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-11-23 20:56:51,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79500133] [2019-11-23 20:56:51,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392169952] [2019-11-23 20:56:51,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:51,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:56:51,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-23 20:56:51,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:51,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:56:51,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488380088] [2019-11-23 20:56:51,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:51,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:51,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:51,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:56:51,776 INFO L87 Difference]: Start difference. First operand 13657 states and 14892 transitions. Second operand 3 states. [2019-11-23 20:56:52,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:52,516 INFO L93 Difference]: Finished difference Result 38502 states and 41959 transitions. [2019-11-23 20:56:52,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:52,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 453 [2019-11-23 20:56:52,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:52,544 INFO L225 Difference]: With dead ends: 38502 [2019-11-23 20:56:52,544 INFO L226 Difference]: Without dead ends: 24847 [2019-11-23 20:56:52,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 452 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:56:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24847 states. [2019-11-23 20:56:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24847 to 24847. [2019-11-23 20:56:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24847 states. [2019-11-23 20:56:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24847 states to 24847 states and 26857 transitions. [2019-11-23 20:56:52,840 INFO L78 Accepts]: Start accepts. Automaton has 24847 states and 26857 transitions. Word has length 453 [2019-11-23 20:56:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:52,840 INFO L462 AbstractCegarLoop]: Abstraction has 24847 states and 26857 transitions. [2019-11-23 20:56:52,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24847 states and 26857 transitions. [2019-11-23 20:56:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-11-23 20:56:52,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:52,865 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 20:56:53,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:53,070 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:53,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:53,071 INFO L82 PathProgramCache]: Analyzing trace with hash -852721927, now seen corresponding path program 1 times [2019-11-23 20:56:53,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:53,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251541205] [2019-11-23 20:56:53,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-23 20:56:53,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251541205] [2019-11-23 20:56:53,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:53,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:53,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116813273] [2019-11-23 20:56:53,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:53,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:53,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:53,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:53,674 INFO L87 Difference]: Start difference. First operand 24847 states and 26857 transitions. Second operand 3 states. [2019-11-23 20:56:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:54,615 INFO L93 Difference]: Finished difference Result 54783 states and 59135 transitions. [2019-11-23 20:56:54,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:54,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 455 [2019-11-23 20:56:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:54,616 INFO L225 Difference]: With dead ends: 54783 [2019-11-23 20:56:54,616 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:56:54,636 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:54,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:56:54,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:56:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:56:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:56:54,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 455 [2019-11-23 20:56:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:54,637 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:56:54,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:54,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:56:54,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:56:54,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:56:55,622 WARN L192 SmtUtils]: Spent 968.00 ms on a formula simplification. DAG size of input: 372 DAG size of output: 304 [2019-11-23 20:56:56,368 WARN L192 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 372 DAG size of output: 304 [2019-11-23 20:56:58,700 WARN L192 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 301 DAG size of output: 50 [2019-11-23 20:57:01,119 WARN L192 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 301 DAG size of output: 50 [2019-11-23 20:57:01,123 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:57:01,123 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:57:01,124 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,124 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,124 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,124 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,124 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,125 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,125 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,125 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-23 20:57:01,125 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,125 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-23 20:57:01,126 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-23 20:57:01,126 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,126 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,126 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,126 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,126 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:57:01,126 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:57:01,126 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,126 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,126 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,127 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,128 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,128 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,128 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-23 20:57:01,128 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-23 20:57:01,128 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-23 20:57:01,128 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,128 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,128 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,128 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,128 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,129 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,129 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-23 20:57:01,129 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-23 20:57:01,129 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-23 20:57:01,129 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,129 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,129 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,129 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:57:01,129 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,129 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:57:01,129 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,129 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,130 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:57:01,130 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:57:01,130 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,130 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,130 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,130 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,130 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,130 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,130 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,131 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:57:01,131 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:57:01,131 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-23 20:57:01,131 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-23 20:57:01,131 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-23 20:57:01,131 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,131 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,131 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,131 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,132 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,132 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,132 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,132 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,132 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,132 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,132 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-23 20:57:01,132 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-23 20:57:01,132 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-23 20:57:01,133 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,133 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,133 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,133 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,133 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,133 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,133 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,133 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,133 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,133 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,134 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-23 20:57:01,135 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-23 20:57:01,135 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-23 20:57:01,135 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,135 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,135 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,135 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:57:01,135 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:57:01,135 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,135 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,135 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,135 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:57:01,135 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,135 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:57:01,136 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,136 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-23 20:57:01,136 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,136 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,136 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:57:01,136 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:57:01,136 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:57:01,136 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:57:01,136 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-23 20:57:01,137 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-23 20:57:01,137 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-23 20:57:01,137 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,137 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,137 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,137 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse9 (= 1 ~a6~0)) (.cse4 (= ~a11~0 1))) (let ((.cse6 (<= ~a3~0 1)) (.cse8 (= 0 ~a3~0)) (.cse7 (not .cse4)) (.cse3 (<= ~a27~0 0)) (.cse11 (not (= 1 ~a3~0))) (.cse1 (not (= ~a12~0 1))) (.cse5 (not .cse9)) (.cse10 (= ~a27~0 1)) (.cse0 (= 1 ~a5~0)) (.cse2 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2 .cse3) (and .cse6 .cse0 .cse1 .cse7 .cse5 .cse3) (and .cse0 .cse8 .cse7 .cse3) (and .cse6 (not .cse2) .cse0 .cse9 .cse3) (and .cse0 .cse10 .cse9 .cse11) (and .cse0 .cse1 .cse4 .cse5 .cse3 .cse11) (and .cse10 .cse0 .cse9 .cse2) (and .cse0 .cse9 .cse7 .cse3) (and .cse10 .cse0 .cse1 .cse7) (and .cse0 .cse8 .cse2 .cse3) (and .cse10 .cse0 .cse7 .cse11) (and .cse0 .cse5 .cse2 .cse3 .cse11) (and .cse0 .cse10 .cse1 .cse5) (and .cse0 .cse10 .cse4 .cse2) (and .cse10 .cse0 (<= ~a10~0 0) .cse2)))) [2019-11-23 20:57:01,138 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,138 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,138 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,138 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-23 20:57:01,138 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-23 20:57:01,138 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,138 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,138 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:57:01,139 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1602) no Hoare annotation was computed. [2019-11-23 20:57:01,139 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,139 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-23 20:57:01,139 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,139 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,139 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,139 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,139 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,139 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,140 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-23 20:57:01,140 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-23 20:57:01,140 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,140 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,140 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,140 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,140 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,140 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,140 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,140 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,140 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,141 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-23 20:57:01,141 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-23 20:57:01,141 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,141 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,141 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:57:01,141 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:57:01,141 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,142 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse9 (= 1 ~a6~0)) (.cse4 (= ~a11~0 1))) (let ((.cse6 (<= ~a3~0 1)) (.cse8 (= 0 ~a3~0)) (.cse7 (not .cse4)) (.cse3 (<= ~a27~0 0)) (.cse11 (not (= 1 ~a3~0))) (.cse1 (not (= ~a12~0 1))) (.cse5 (not .cse9)) (.cse10 (= ~a27~0 1)) (.cse0 (= 1 ~a5~0)) (.cse2 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2 .cse3) (and .cse6 .cse0 .cse1 .cse7 .cse5 .cse3) (and .cse0 .cse8 .cse7 .cse3) (and .cse6 (not .cse2) .cse0 .cse9 .cse3) (and .cse0 .cse10 .cse9 .cse11) (and .cse0 .cse1 .cse4 .cse5 .cse3 .cse11) (and .cse10 .cse0 .cse9 .cse2) (and .cse0 .cse9 .cse7 .cse3) (and .cse10 .cse0 .cse1 .cse7) (and .cse0 .cse8 .cse2 .cse3) (and .cse10 .cse0 .cse7 .cse11) (and .cse0 .cse5 .cse2 .cse3 .cse11) (and .cse0 .cse10 .cse1 .cse5) (and .cse0 .cse10 .cse4 .cse2) (and .cse10 .cse0 (<= ~a10~0 0) .cse2)))) [2019-11-23 20:57:01,142 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,142 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,142 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,142 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,142 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-23 20:57:01,142 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-23 20:57:01,142 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,142 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,143 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,143 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,143 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,143 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,143 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,143 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,143 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:57:01,143 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:57:01,143 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-23 20:57:01,143 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,144 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-23 20:57:01,144 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,144 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,144 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-23 20:57:01,144 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,144 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,144 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,144 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,144 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,144 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-23 20:57:01,144 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,145 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-23 20:57:01,145 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-23 20:57:01,145 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-23 20:57:01,145 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,145 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,145 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,145 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,145 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,145 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,145 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,146 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,146 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:57:01,146 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:57:01,146 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,146 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,146 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-23 20:57:01,146 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-23 20:57:01,146 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-23 20:57:01,146 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,147 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,147 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,147 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,147 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,147 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,147 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,147 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,147 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,147 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,147 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,148 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-23 20:57:01,148 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-23 20:57:01,148 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-23 20:57:01,148 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:57:01,148 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,148 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,148 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,148 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,148 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,148 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,149 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,149 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:57:01,149 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:57:01,149 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,149 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-23 20:57:01,149 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-23 20:57:01,149 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-23 20:57:01,149 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,149 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,149 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,150 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,150 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,150 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:57:01,150 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:57:01,150 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,150 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,150 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,150 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-23 20:57:01,150 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-23 20:57:01,150 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,151 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-23 20:57:01,151 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,151 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,151 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,151 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,151 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,151 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,151 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,152 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,152 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,152 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,152 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:57:01,152 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-23 20:57:01,152 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-23 20:57:01,152 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-23 20:57:01,152 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,152 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:57:01,152 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:57:01,153 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,153 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,153 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,153 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,153 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,153 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,153 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,153 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,153 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,153 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-23 20:57:01,154 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-23 20:57:01,154 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-23 20:57:01,154 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,154 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,154 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,154 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,154 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:57:01,154 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,154 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-23 20:57:01,154 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-23 20:57:01,154 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,155 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-23 20:57:01,155 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-23 20:57:01,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:57:01 BoogieIcfgContainer [2019-11-23 20:57:01,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:57:01,182 INFO L168 Benchmark]: Toolchain (without parser) took 40560.09 ms. Allocated memory was 142.1 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 97.6 MB in the beginning and 859.6 MB in the end (delta: -762.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-11-23 20:57:01,183 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 142.1 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 20:57:01,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1302.26 ms. Allocated memory was 142.1 MB in the beginning and 209.2 MB in the end (delta: 67.1 MB). Free memory was 97.4 MB in the beginning and 132.8 MB in the end (delta: -35.4 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. [2019-11-23 20:57:01,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.04 ms. Allocated memory is still 209.2 MB. Free memory was 132.8 MB in the beginning and 118.0 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:57:01,185 INFO L168 Benchmark]: Boogie Preprocessor took 135.81 ms. Allocated memory is still 209.2 MB. Free memory was 118.0 MB in the beginning and 106.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:01,186 INFO L168 Benchmark]: RCFGBuilder took 2115.32 ms. Allocated memory was 209.2 MB in the beginning and 265.3 MB in the end (delta: 56.1 MB). Free memory was 106.7 MB in the beginning and 102.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 70.5 MB. Max. memory is 7.1 GB. [2019-11-23 20:57:01,187 INFO L168 Benchmark]: TraceAbstraction took 36857.85 ms. Allocated memory was 265.3 MB in the beginning and 1.2 GB in the end (delta: 961.5 MB). Free memory was 102.1 MB in the beginning and 859.6 MB in the end (delta: -757.4 MB). Peak memory consumption was 939.9 MB. Max. memory is 7.1 GB. [2019-11-23 20:57:01,190 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.19 ms. Allocated memory is still 142.1 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1302.26 ms. Allocated memory was 142.1 MB in the beginning and 209.2 MB in the end (delta: 67.1 MB). Free memory was 97.4 MB in the beginning and 132.8 MB in the end (delta: -35.4 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 142.04 ms. Allocated memory is still 209.2 MB. Free memory was 132.8 MB in the beginning and 118.0 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.81 ms. Allocated memory is still 209.2 MB. Free memory was 118.0 MB in the beginning and 106.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2115.32 ms. Allocated memory was 209.2 MB in the beginning and 265.3 MB in the end (delta: 56.1 MB). Free memory was 106.7 MB in the beginning and 102.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 70.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36857.85 ms. Allocated memory was 265.3 MB in the beginning and 1.2 GB in the end (delta: 961.5 MB). Free memory was 102.1 MB in the beginning and 859.6 MB in the end (delta: -757.4 MB). Peak memory consumption was 939.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1602]: 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: (((((((((((((((((1 == a5 && !(a12 == 1)) && a26 == 1) && a27 <= 0) || ((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && a27 <= 0)) || (((((a3 <= 1 && 1 == a5) && !(a12 == 1)) && !(a11 == 1)) && !(1 == a6)) && a27 <= 0)) || (((1 == a5 && 0 == a3) && !(a11 == 1)) && a27 <= 0)) || ((((a3 <= 1 && !(a26 == 1)) && 1 == a5) && 1 == a6) && a27 <= 0)) || (((1 == a5 && a27 == 1) && 1 == a6) && !(1 == a3))) || (((((1 == a5 && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a27 <= 0) && !(1 == a3))) || (((a27 == 1 && 1 == a5) && 1 == a6) && a26 == 1)) || (((1 == a5 && 1 == a6) && !(a11 == 1)) && a27 <= 0)) || (((a27 == 1 && 1 == a5) && !(a12 == 1)) && !(a11 == 1))) || (((1 == a5 && 0 == a3) && a26 == 1) && a27 <= 0)) || (((a27 == 1 && 1 == a5) && !(a11 == 1)) && !(1 == a3))) || ((((1 == a5 && !(1 == a6)) && a26 == 1) && a27 <= 0) && !(1 == a3))) || (((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a6))) || (((1 == a5 && a27 == 1) && a11 == 1) && a26 == 1)) || (((a27 == 1 && 1 == a5) && a10 <= 0) && a26 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == a5 && !(a12 == 1)) && a26 == 1) && a27 <= 0) || ((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && a27 <= 0)) || (((((a3 <= 1 && 1 == a5) && !(a12 == 1)) && !(a11 == 1)) && !(1 == a6)) && a27 <= 0)) || (((1 == a5 && 0 == a3) && !(a11 == 1)) && a27 <= 0)) || ((((a3 <= 1 && !(a26 == 1)) && 1 == a5) && 1 == a6) && a27 <= 0)) || (((1 == a5 && a27 == 1) && 1 == a6) && !(1 == a3))) || (((((1 == a5 && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a27 <= 0) && !(1 == a3))) || (((a27 == 1 && 1 == a5) && 1 == a6) && a26 == 1)) || (((1 == a5 && 1 == a6) && !(a11 == 1)) && a27 <= 0)) || (((a27 == 1 && 1 == a5) && !(a12 == 1)) && !(a11 == 1))) || (((1 == a5 && 0 == a3) && a26 == 1) && a27 <= 0)) || (((a27 == 1 && 1 == a5) && !(a11 == 1)) && !(1 == a3))) || ((((1 == a5 && !(1 == a6)) && a26 == 1) && a27 <= 0) && !(1 == a3))) || (((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a6))) || (((1 == a5 && a27 == 1) && a11 == 1) && a26 == 1)) || (((a27 == 1 && 1 == a5) && a10 <= 0) && a26 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 36.7s, OverallIterations: 15, TraceHistogramMax: 6, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.4s, HoareTripleCheckerStatistics: 3282 SDtfs, 3603 SDslu, 690 SDs, 0 SdLazy, 11041 SolverSat, 2003 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1416 GetRequests, 1378 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24847occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 15373 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 300 NumberOfFragments, 501 HoareAnnotationTreeSize, 3 FomulaSimplifications, 8764 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 30028 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 5969 NumberOfCodeBlocks, 5969 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5950 ConstructedInterpolants, 0 QuantifiedInterpolants, 3769545 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2316 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 3763/3786 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...