java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:49:24,361 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:49:24,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:49:24,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:49:24,375 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:49:24,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:49:24,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:49:24,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:49:24,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:49:24,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:49:24,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:49:24,381 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:49:24,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:49:24,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:49:24,383 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:49:24,385 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:49:24,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:49:24,388 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:49:24,389 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:49:24,390 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:49:24,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:49:24,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:49:24,392 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:49:24,393 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:49:24,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:49:24,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:49:24,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:49:24,395 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:49:24,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:49:24,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:49:24,396 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:49:24,396 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 22:49:24,405 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:49:24,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:49:24,406 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:49:24,406 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:49:24,406 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:49:24,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:49:24,406 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:49:24,406 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:49:24,406 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:49:24,407 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:49:24,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:49:24,407 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:49:24,407 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:49:24,407 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:49:24,407 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:49:24,407 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:49:24,407 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:49:24,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:49:24,407 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:49:24,408 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:49:24,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:49:24,408 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:49:24,408 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:49:24,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:49:24,408 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:49:24,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:49:24,447 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:49:24,449 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:49:24,450 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:49:24,451 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:49:24,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:49:24,563 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:49:24,564 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:49:24,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:49:24,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:49:24,569 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:49:24,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:49:24" (1/1) ... [2018-02-03 22:49:24,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfe84f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:49:24, skipping insertion in model container [2018-02-03 22:49:24,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:49:24" (1/1) ... [2018-02-03 22:49:24,582 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:49:24,611 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:49:24,699 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:49:24,713 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:49:24,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:49:24 WrapperNode [2018-02-03 22:49:24,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:49:24,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:49:24,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:49:24,720 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:49:24,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:49:24" (1/1) ... [2018-02-03 22:49:24,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:49:24" (1/1) ... [2018-02-03 22:49:24,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:49:24" (1/1) ... [2018-02-03 22:49:24,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:49:24" (1/1) ... [2018-02-03 22:49:24,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:49:24" (1/1) ... [2018-02-03 22:49:24,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:49:24" (1/1) ... [2018-02-03 22:49:24,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:49:24" (1/1) ... [2018-02-03 22:49:24,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:49:24,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:49:24,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:49:24,750 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:49:24,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:49:24" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-02-03 22:49:24,789 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:49:24,789 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:49:24,790 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-02-03 22:49:24,790 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:49:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:49:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:49:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:49:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:49:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:49:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:49:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-02-03 22:49:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:49:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:49:24,791 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:49:25,070 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:49:25,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:49:25 BoogieIcfgContainer [2018-02-03 22:49:25,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:49:25,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:49:25,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:49:25,074 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:49:25,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:49:24" (1/3) ... [2018-02-03 22:49:25,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcf323a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:49:25, skipping insertion in model container [2018-02-03 22:49:25,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:49:24" (2/3) ... [2018-02-03 22:49:25,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcf323a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:49:25, skipping insertion in model container [2018-02-03 22:49:25,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:49:25" (3/3) ... [2018-02-03 22:49:25,077 INFO L107 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:49:25,083 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:49:25,089 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-03 22:49:25,115 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:49:25,116 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:49:25,116 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:49:25,116 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:49:25,116 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:49:25,116 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:49:25,116 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:49:25,116 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:49:25,117 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:49:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-02-03 22:49:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:49:25,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:25,135 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:49:25,135 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:25,138 INFO L82 PathProgramCache]: Analyzing trace with hash -456745945, now seen corresponding path program 1 times [2018-02-03 22:49:25,139 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:25,140 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:25,170 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:25,171 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:25,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:25,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:25,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:49:25,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:49:25,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:49:25,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:49:25,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:49:25,352 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2018-02-03 22:49:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:25,440 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-03 22:49:25,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:49:25,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-03 22:49:25,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:25,448 INFO L225 Difference]: With dead ends: 77 [2018-02-03 22:49:25,449 INFO L226 Difference]: Without dead ends: 74 [2018-02-03 22:49:25,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:49:25,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-03 22:49:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-03 22:49:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-03 22:49:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-03 22:49:25,479 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 18 [2018-02-03 22:49:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:25,479 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-03 22:49:25,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:49:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-03 22:49:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:49:25,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:25,480 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:49:25,480 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:25,480 INFO L82 PathProgramCache]: Analyzing trace with hash -456745944, now seen corresponding path program 1 times [2018-02-03 22:49:25,480 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:25,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:25,481 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:25,481 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:25,481 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:25,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:25,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:49:25,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:49:25,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 22:49:25,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 22:49:25,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:49:25,584 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-02-03 22:49:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:25,805 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-02-03 22:49:25,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:49:25,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-03 22:49:25,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:25,810 INFO L225 Difference]: With dead ends: 96 [2018-02-03 22:49:25,810 INFO L226 Difference]: Without dead ends: 96 [2018-02-03 22:49:25,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:49:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-03 22:49:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-02-03 22:49:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-03 22:49:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-03 22:49:25,818 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 18 [2018-02-03 22:49:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:25,818 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-03 22:49:25,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 22:49:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-03 22:49:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 22:49:25,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:25,819 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:49:25,819 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:25,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222418, now seen corresponding path program 1 times [2018-02-03 22:49:25,820 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:25,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:25,820 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:25,821 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:25,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:25,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:25,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:49:25,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:49:25,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:49:25,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:49:25,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:49:25,864 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2018-02-03 22:49:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:25,898 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-02-03 22:49:25,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:49:25,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-03 22:49:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:25,899 INFO L225 Difference]: With dead ends: 80 [2018-02-03 22:49:25,899 INFO L226 Difference]: Without dead ends: 80 [2018-02-03 22:49:25,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:49:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-03 22:49:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-03 22:49:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-03 22:49:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-02-03 22:49:25,903 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 19 [2018-02-03 22:49:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:25,903 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-02-03 22:49:25,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:49:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-02-03 22:49:25,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 22:49:25,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:25,904 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:49:25,904 INFO L371 AbstractCegarLoop]: === Iteration 4 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:25,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222417, now seen corresponding path program 1 times [2018-02-03 22:49:25,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:25,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:25,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:25,906 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:25,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:25,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:25,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:49:25,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:49:25,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:49:25,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:49:25,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:49:25,988 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 8 states. [2018-02-03 22:49:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:26,150 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-02-03 22:49:26,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:49:26,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-03 22:49:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:26,152 INFO L225 Difference]: With dead ends: 97 [2018-02-03 22:49:26,152 INFO L226 Difference]: Without dead ends: 97 [2018-02-03 22:49:26,152 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-02-03 22:49:26,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-03 22:49:26,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-02-03 22:49:26,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-03 22:49:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-02-03 22:49:26,157 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2018-02-03 22:49:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:26,157 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-02-03 22:49:26,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:49:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-02-03 22:49:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:49:26,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:26,158 INFO L351 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] [2018-02-03 22:49:26,159 INFO L371 AbstractCegarLoop]: === Iteration 5 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:26,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1183954355, now seen corresponding path program 1 times [2018-02-03 22:49:26,159 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:26,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:26,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:26,160 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:26,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:26,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:26,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:49:26,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:49:26,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:49:26,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:49:26,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:49:26,216 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 6 states. [2018-02-03 22:49:26,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:26,295 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2018-02-03 22:49:26,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:49:26,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-03 22:49:26,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:26,296 INFO L225 Difference]: With dead ends: 128 [2018-02-03 22:49:26,296 INFO L226 Difference]: Without dead ends: 128 [2018-02-03 22:49:26,296 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:49:26,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-03 22:49:26,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-02-03 22:49:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-03 22:49:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-02-03 22:49:26,301 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 23 [2018-02-03 22:49:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:26,301 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-02-03 22:49:26,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:49:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-02-03 22:49:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:49:26,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:26,301 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:49:26,301 INFO L371 AbstractCegarLoop]: === Iteration 6 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:26,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1662425565, now seen corresponding path program 1 times [2018-02-03 22:49:26,302 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:26,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:26,302 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:26,302 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:26,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:26,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:26,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:26,393 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:49:26,401 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:26,428 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:26,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:49:26,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 11 [2018-02-03 22:49:26,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 22:49:26,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 22:49:26,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-03 22:49:26,486 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 11 states. [2018-02-03 22:49:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:26,652 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-03 22:49:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 22:49:26,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-03 22:49:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:26,653 INFO L225 Difference]: With dead ends: 126 [2018-02-03 22:49:26,653 INFO L226 Difference]: Without dead ends: 126 [2018-02-03 22:49:26,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2018-02-03 22:49:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-03 22:49:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2018-02-03 22:49:26,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-03 22:49:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-02-03 22:49:26,658 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 23 [2018-02-03 22:49:26,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:26,658 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-02-03 22:49:26,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 22:49:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-02-03 22:49:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:49:26,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:26,658 INFO L351 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] [2018-02-03 22:49:26,659 INFO L371 AbstractCegarLoop]: === Iteration 7 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash -404393547, now seen corresponding path program 1 times [2018-02-03 22:49:26,659 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:26,659 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:26,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:26,660 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:26,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:26,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:26,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:49:26,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:49:26,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:49:26,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:49:26,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:49:26,707 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 6 states. [2018-02-03 22:49:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:26,747 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-02-03 22:49:26,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:49:26,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-03 22:49:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:26,748 INFO L225 Difference]: With dead ends: 117 [2018-02-03 22:49:26,748 INFO L226 Difference]: Without dead ends: 117 [2018-02-03 22:49:26,749 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:49:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-03 22:49:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-02-03 22:49:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-03 22:49:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-02-03 22:49:26,752 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 23 [2018-02-03 22:49:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:26,752 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-02-03 22:49:26,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:49:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-02-03 22:49:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:49:26,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:26,753 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:49:26,753 INFO L371 AbstractCegarLoop]: === Iteration 8 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:26,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1044193829, now seen corresponding path program 1 times [2018-02-03 22:49:26,753 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:26,753 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:26,754 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:26,754 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:26,754 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:26,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:26,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:26,859 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:49:26,867 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:26,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:26,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 22:49:26,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:26,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:49:26,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:26,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:26,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-03 22:49:26,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:26,921 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:26,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:49:26,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:26,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-03 22:49:26,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:26,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:26,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-03 22:49:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:27,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:49:27,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-03 22:49:27,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 22:49:27,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 22:49:27,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:49:27,046 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 12 states. [2018-02-03 22:49:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:27,334 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-02-03 22:49:27,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:49:27,335 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-02-03 22:49:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:27,335 INFO L225 Difference]: With dead ends: 112 [2018-02-03 22:49:27,336 INFO L226 Difference]: Without dead ends: 112 [2018-02-03 22:49:27,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-02-03 22:49:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-03 22:49:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2018-02-03 22:49:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-03 22:49:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-02-03 22:49:27,341 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 23 [2018-02-03 22:49:27,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:27,341 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-02-03 22:49:27,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 22:49:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-02-03 22:49:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:49:27,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:27,342 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-03 22:49:27,343 INFO L371 AbstractCegarLoop]: === Iteration 9 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:27,343 INFO L82 PathProgramCache]: Analyzing trace with hash 186672598, now seen corresponding path program 1 times [2018-02-03 22:49:27,343 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:27,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:27,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:27,344 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:27,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:27,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:27,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:27,381 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:49:27,385 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:27,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:27,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:49:27,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-03 22:49:27,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:49:27,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:49:27,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:49:27,442 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 8 states. [2018-02-03 22:49:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:27,577 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2018-02-03 22:49:27,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 22:49:27,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-03 22:49:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:27,579 INFO L225 Difference]: With dead ends: 176 [2018-02-03 22:49:27,579 INFO L226 Difference]: Without dead ends: 176 [2018-02-03 22:49:27,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-03 22:49:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-03 22:49:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 124. [2018-02-03 22:49:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-03 22:49:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-02-03 22:49:27,585 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 28 [2018-02-03 22:49:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:27,586 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-02-03 22:49:27,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:49:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-02-03 22:49:27,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 22:49:27,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:27,587 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-03 22:49:27,587 INFO L371 AbstractCegarLoop]: === Iteration 10 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:27,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1928191573, now seen corresponding path program 2 times [2018-02-03 22:49:27,587 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:27,588 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:27,588 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:27,588 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:27,588 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:27,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:27,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:27,852 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:49:27,858 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:49:27,869 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-03 22:49:27,869 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:49:27,871 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:27,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:49:27,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:27,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 22:49:27,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:27,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:27,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-03 22:49:27,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:27,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:27,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-03 22:49:27,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:27,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-03 22:49:27,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:27,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 22:49:27,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:35 [2018-02-03 22:49:28,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:28,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:28,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:28,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:49:28,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:28,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-02-03 22:49:28,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:28,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-03 22:49:28,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2018-02-03 22:49:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-03 22:49:28,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:49:28,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 18 [2018-02-03 22:49:28,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-03 22:49:28,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-03 22:49:28,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-03 22:49:28,232 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 19 states. [2018-02-03 22:49:28,593 WARN L146 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 43 DAG size of output 42 [2018-02-03 22:49:29,163 WARN L146 SmtUtils]: Spent 314ms on a formula simplification. DAG size of input: 62 DAG size of output 61 [2018-02-03 22:49:29,573 WARN L146 SmtUtils]: Spent 301ms on a formula simplification. DAG size of input: 65 DAG size of output 58 [2018-02-03 22:49:29,991 WARN L146 SmtUtils]: Spent 301ms on a formula simplification. DAG size of input: 61 DAG size of output 60 [2018-02-03 22:49:30,337 WARN L146 SmtUtils]: Spent 291ms on a formula simplification. DAG size of input: 63 DAG size of output 58 [2018-02-03 22:49:30,609 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 40 DAG size of output 39 [2018-02-03 22:49:30,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:30,895 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2018-02-03 22:49:30,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-03 22:49:30,895 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-02-03 22:49:30,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:30,896 INFO L225 Difference]: With dead ends: 162 [2018-02-03 22:49:30,896 INFO L226 Difference]: Without dead ends: 162 [2018-02-03 22:49:30,896 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=341, Invalid=991, Unknown=0, NotChecked=0, Total=1332 [2018-02-03 22:49:30,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-03 22:49:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 121. [2018-02-03 22:49:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-03 22:49:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-02-03 22:49:30,899 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 33 [2018-02-03 22:49:30,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:30,899 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-02-03 22:49:30,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-03 22:49:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2018-02-03 22:49:30,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 22:49:30,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:30,900 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-03 22:49:30,900 INFO L371 AbstractCegarLoop]: === Iteration 11 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:30,900 INFO L82 PathProgramCache]: Analyzing trace with hash -355603392, now seen corresponding path program 1 times [2018-02-03 22:49:30,900 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:30,900 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:30,901 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:30,901 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:49:30,901 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:30,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-03 22:49:30,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:49:30,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:49:30,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:49:30,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:49:30,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:49:30,982 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 9 states. [2018-02-03 22:49:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:31,117 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2018-02-03 22:49:31,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:49:31,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-03 22:49:31,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:31,118 INFO L225 Difference]: With dead ends: 158 [2018-02-03 22:49:31,119 INFO L226 Difference]: Without dead ends: 158 [2018-02-03 22:49:31,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-02-03 22:49:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-03 22:49:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2018-02-03 22:49:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-03 22:49:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-02-03 22:49:31,126 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 34 [2018-02-03 22:49:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:31,126 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-02-03 22:49:31,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:49:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-02-03 22:49:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-03 22:49:31,127 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:31,127 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-03 22:49:31,127 INFO L371 AbstractCegarLoop]: === Iteration 12 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:31,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1116063411, now seen corresponding path program 1 times [2018-02-03 22:49:31,128 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:31,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:31,128 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:31,129 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:31,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:31,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-03 22:49:31,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:49:31,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:49:31,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 22:49:31,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 22:49:31,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:49:31,158 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 3 states. [2018-02-03 22:49:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:31,163 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-03 22:49:31,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 22:49:31,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-02-03 22:49:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:31,164 INFO L225 Difference]: With dead ends: 126 [2018-02-03 22:49:31,164 INFO L226 Difference]: Without dead ends: 126 [2018-02-03 22:49:31,164 INFO L554 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 [2018-02-03 22:49:31,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-03 22:49:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-03 22:49:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-03 22:49:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-02-03 22:49:31,168 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 38 [2018-02-03 22:49:31,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:31,168 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-02-03 22:49:31,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 22:49:31,168 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-02-03 22:49:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-03 22:49:31,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:31,169 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-03 22:49:31,169 INFO L371 AbstractCegarLoop]: === Iteration 13 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:31,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1116072442, now seen corresponding path program 1 times [2018-02-03 22:49:31,170 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:31,170 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:31,170 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:31,170 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:31,170 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:31,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-03 22:49:31,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:49:31,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 22:49:31,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 22:49:31,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 22:49:31,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-03 22:49:31,261 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 11 states. [2018-02-03 22:49:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:31,404 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-02-03 22:49:31,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-03 22:49:31,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-03 22:49:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:31,405 INFO L225 Difference]: With dead ends: 125 [2018-02-03 22:49:31,405 INFO L226 Difference]: Without dead ends: 125 [2018-02-03 22:49:31,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-02-03 22:49:31,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-03 22:49:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-02-03 22:49:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-03 22:49:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-02-03 22:49:31,409 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 38 [2018-02-03 22:49:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:31,409 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-02-03 22:49:31,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 22:49:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-02-03 22:49:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-03 22:49:31,410 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:31,410 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-03 22:49:31,411 INFO L371 AbstractCegarLoop]: === Iteration 14 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:31,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1390751146, now seen corresponding path program 1 times [2018-02-03 22:49:31,411 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:31,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:31,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:31,412 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:31,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:31,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-03 22:49:31,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:49:31,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-03 22:49:31,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:49:31,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:49:31,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:49:31,476 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 9 states. [2018-02-03 22:49:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:31,537 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-02-03 22:49:31,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:49:31,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-03 22:49:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:31,538 INFO L225 Difference]: With dead ends: 143 [2018-02-03 22:49:31,538 INFO L226 Difference]: Without dead ends: 143 [2018-02-03 22:49:31,538 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-02-03 22:49:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-03 22:49:31,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-02-03 22:49:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-03 22:49:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2018-02-03 22:49:31,541 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 42 [2018-02-03 22:49:31,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:31,542 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2018-02-03 22:49:31,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:49:31,542 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2018-02-03 22:49:31,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-03 22:49:31,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:31,543 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-03 22:49:31,543 INFO L371 AbstractCegarLoop]: === Iteration 15 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:31,543 INFO L82 PathProgramCache]: Analyzing trace with hash -363955689, now seen corresponding path program 1 times [2018-02-03 22:49:31,543 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:31,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:31,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:31,544 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:31,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:31,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:31,802 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:31,802 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:49:31,807 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:31,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:31,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:49:31,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:31,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:31,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:49:31,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:31,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:31,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:49:31,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:31,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:31,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-03 22:49:31,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-03 22:49:31,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-03 22:49:31,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:31,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:31,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:31,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-02-03 22:49:31,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-03 22:49:31,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 22:49:31,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:31,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:31,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 22:49:31,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-02-03 22:49:31,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-02-03 22:49:31,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-03 22:49:31,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:31,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-03 22:49:31,971 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:31,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:31,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:31,975 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-02-03 22:49:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:32,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:49:32,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-02-03 22:49:32,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-03 22:49:32,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-03 22:49:32,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-02-03 22:49:32,007 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand 24 states. [2018-02-03 22:49:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:33,087 INFO L93 Difference]: Finished difference Result 253 states and 281 transitions. [2018-02-03 22:49:33,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-03 22:49:33,088 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-02-03 22:49:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:33,089 INFO L225 Difference]: With dead ends: 253 [2018-02-03 22:49:33,089 INFO L226 Difference]: Without dead ends: 253 [2018-02-03 22:49:33,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=614, Invalid=1936, Unknown=0, NotChecked=0, Total=2550 [2018-02-03 22:49:33,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-03 22:49:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 147. [2018-02-03 22:49:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-03 22:49:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2018-02-03 22:49:33,093 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 44 [2018-02-03 22:49:33,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:33,093 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-02-03 22:49:33,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-03 22:49:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2018-02-03 22:49:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-03 22:49:33,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:33,093 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-03 22:49:33,093 INFO L371 AbstractCegarLoop]: === Iteration 16 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2022275116, now seen corresponding path program 1 times [2018-02-03 22:49:33,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:33,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:33,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:33,094 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:33,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:33,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-03 22:49:33,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:49:33,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:49:33,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:49:33,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:49:33,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:49:33,251 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand 8 states. [2018-02-03 22:49:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:33,335 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-02-03 22:49:33,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:49:33,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-03 22:49:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:33,336 INFO L225 Difference]: With dead ends: 146 [2018-02-03 22:49:33,336 INFO L226 Difference]: Without dead ends: 72 [2018-02-03 22:49:33,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-03 22:49:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-03 22:49:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-03 22:49:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-03 22:49:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-02-03 22:49:33,337 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 46 [2018-02-03 22:49:33,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:33,337 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-02-03 22:49:33,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:49:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-02-03 22:49:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-03 22:49:33,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:33,338 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-03 22:49:33,338 INFO L371 AbstractCegarLoop]: === Iteration 17 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:33,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1787354498, now seen corresponding path program 1 times [2018-02-03 22:49:33,338 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:33,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:33,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:33,339 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:33,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:33,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-03 22:49:33,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:33,420 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:49:33,428 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:33,449 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-03 22:49:33,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:49:33,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2018-02-03 22:49:33,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 22:49:33,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 22:49:33,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-03 22:49:33,508 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 13 states. [2018-02-03 22:49:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:33,638 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-02-03 22:49:33,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 22:49:33,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-02-03 22:49:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:33,639 INFO L225 Difference]: With dead ends: 88 [2018-02-03 22:49:33,639 INFO L226 Difference]: Without dead ends: 88 [2018-02-03 22:49:33,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2018-02-03 22:49:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-03 22:49:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2018-02-03 22:49:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-03 22:49:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-03 22:49:33,641 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 47 [2018-02-03 22:49:33,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:33,641 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-03 22:49:33,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 22:49:33,641 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-03 22:49:33,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-03 22:49:33,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:33,642 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2018-02-03 22:49:33,642 INFO L371 AbstractCegarLoop]: === Iteration 18 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:33,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1878068012, now seen corresponding path program 2 times [2018-02-03 22:49:33,642 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:33,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:33,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:33,643 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:49:33,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:33,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-03 22:49:33,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:33,751 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:49:33,760 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:49:33,789 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:49:33,790 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:49:33,792 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-03 22:49:33,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:49:33,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-02-03 22:49:33,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-03 22:49:33,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-03 22:49:33,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-02-03 22:49:33,877 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 18 states. [2018-02-03 22:49:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:34,115 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2018-02-03 22:49:34,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 22:49:34,115 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-02-03 22:49:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:34,116 INFO L225 Difference]: With dead ends: 129 [2018-02-03 22:49:34,116 INFO L226 Difference]: Without dead ends: 105 [2018-02-03 22:49:34,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 22:49:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-03 22:49:34,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-02-03 22:49:34,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-03 22:49:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-03 22:49:34,118 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 55 [2018-02-03 22:49:34,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:34,118 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-03 22:49:34,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-03 22:49:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-03 22:49:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-03 22:49:34,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:34,119 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-02-03 22:49:34,119 INFO L371 AbstractCegarLoop]: === Iteration 19 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-03 22:49:34,119 INFO L82 PathProgramCache]: Analyzing trace with hash 53164877, now seen corresponding path program 3 times [2018-02-03 22:49:34,119 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:34,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:34,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:34,120 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:49:34,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:34,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-03 22:49:34,197 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:34,197 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:49:34,202 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:49:34,214 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-03 22:49:34,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:49:34,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-03 22:49:34,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:49:34,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 13 [2018-02-03 22:49:34,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-03 22:49:34,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-03 22:49:34,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-02-03 22:49:34,285 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 14 states. [2018-02-03 22:49:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:34,381 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-02-03 22:49:34,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 22:49:34,381 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-02-03 22:49:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:34,381 INFO L225 Difference]: With dead ends: 88 [2018-02-03 22:49:34,381 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 22:49:34,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-02-03 22:49:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 22:49:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 22:49:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 22:49:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 22:49:34,382 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-02-03 22:49:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:34,382 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 22:49:34,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-03 22:49:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 22:49:34,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 22:49:34,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:49:34 BoogieIcfgContainer [2018-02-03 22:49:34,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:49:34,385 INFO L168 Benchmark]: Toolchain (without parser) took 9821.85 ms. Allocated memory was 407.9 MB in the beginning and 762.3 MB in the end (delta: 354.4 MB). Free memory was 361.9 MB in the beginning and 659.3 MB in the end (delta: -297.3 MB). Peak memory consumption was 57.1 MB. Max. memory is 5.3 GB. [2018-02-03 22:49:34,386 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 407.9 MB. Free memory is still 368.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:49:34,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.19 ms. Allocated memory is still 407.9 MB. Free memory was 361.9 MB in the beginning and 351.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:49:34,386 INFO L168 Benchmark]: Boogie Preprocessor took 29.80 ms. Allocated memory is still 407.9 MB. Free memory was 351.3 MB in the beginning and 350.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:49:34,386 INFO L168 Benchmark]: RCFGBuilder took 320.28 ms. Allocated memory is still 407.9 MB. Free memory was 350.0 MB in the beginning and 323.5 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-02-03 22:49:34,387 INFO L168 Benchmark]: TraceAbstraction took 9313.95 ms. Allocated memory was 407.9 MB in the beginning and 762.3 MB in the end (delta: 354.4 MB). Free memory was 323.5 MB in the beginning and 659.3 MB in the end (delta: -335.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:49:34,387 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 407.9 MB. Free memory is still 368.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.19 ms. Allocated memory is still 407.9 MB. Free memory was 361.9 MB in the beginning and 351.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.80 ms. Allocated memory is still 407.9 MB. Free memory was 351.3 MB in the beginning and 350.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 320.28 ms. Allocated memory is still 407.9 MB. Free memory was 350.0 MB in the beginning and 323.5 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9313.95 ms. Allocated memory was 407.9 MB in the beginning and 762.3 MB in the end (delta: 354.4 MB). Free memory was 323.5 MB in the beginning and 659.3 MB in the end (delta: -335.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 23 error locations. SAFE Result, 9.2s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 994 SDtfs, 4354 SDslu, 3469 SDs, 0 SdLazy, 2764 SolverSat, 468 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 595 GetRequests, 296 SyntacticMatches, 11 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 344 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 944 NumberOfCodeBlocks, 916 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 917 ConstructedInterpolants, 42 QuantifiedInterpolants, 235423 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1048 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 27 InterpolantComputations, 15 PerfectInterpolantSequences, 216/280 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-49-34-393.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-49-34-393.csv Received shutdown request...