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/memsafety/lockfree-3.0_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:40:44,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:40:44,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:40:44,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:40:44,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:40:44,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:40:44,378 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:40:44,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:40:44,380 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:40:44,381 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:40:44,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:40:44,381 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:40:44,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:40:44,382 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:40:44,383 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:40:44,384 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:40:44,385 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:40:44,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:40:44,386 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:40:44,387 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:40:44,388 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:40:44,388 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:40:44,388 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:40:44,389 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:40:44,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:40:44,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:40:44,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:40:44,390 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:40:44,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:40:44,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:40:44,391 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:40:44,391 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-02 18:40:44,397 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:40:44,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:40:44,398 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:40:44,398 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:40:44,398 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:40:44,398 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:40:44,398 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:40:44,398 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:40:44,398 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:40:44,398 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:40:44,398 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:40:44,399 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:40:44,399 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:40:44,399 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:40:44,399 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:40:44,399 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:40:44,399 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:40:44,399 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:40:44,399 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:40:44,399 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:40:44,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:40:44,399 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:40:44,399 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:40:44,400 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:40:44,400 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:40:44,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:40:44,431 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:40:44,434 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:40:44,436 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:40:44,436 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:40:44,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.0_true-valid-memsafety.i [2018-02-02 18:40:44,578 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:40:44,579 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:40:44,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:40:44,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:40:44,585 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:40:44,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:40:44" (1/1) ... [2018-02-02 18:40:44,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3112a6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:40:44, skipping insertion in model container [2018-02-02 18:40:44,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:40:44" (1/1) ... [2018-02-02 18:40:44,601 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:40:44,629 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:40:44,716 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:40:44,729 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:40:44,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:40:44 WrapperNode [2018-02-02 18:40:44,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:40:44,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:40:44,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:40:44,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:40:44,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:40:44" (1/1) ... [2018-02-02 18:40:44,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:40:44" (1/1) ... [2018-02-02 18:40:44,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:40:44" (1/1) ... [2018-02-02 18:40:44,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:40:44" (1/1) ... [2018-02-02 18:40:44,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:40:44" (1/1) ... [2018-02-02 18:40:44,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:40:44" (1/1) ... [2018-02-02 18:40:44,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:40:44" (1/1) ... [2018-02-02 18:40:44,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:40:44,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:40:44,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:40:44,761 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:40:44,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:40:44" (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-02 18:40:44,793 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:40:44,793 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:40:44,793 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-02 18:40:44,793 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-02 18:40:44,793 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:40:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 18:40:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 18:40:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:40:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:40:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:40:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:40:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:40:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 18:40:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:40:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:40:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-02 18:40:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-02 18:40:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:40:44,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:40:44,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:40:45,046 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:40:45,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:40:45 BoogieIcfgContainer [2018-02-02 18:40:45,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:40:45,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:40:45,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:40:45,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:40:45,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:40:44" (1/3) ... [2018-02-02 18:40:45,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107b0f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:40:45, skipping insertion in model container [2018-02-02 18:40:45,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:40:44" (2/3) ... [2018-02-02 18:40:45,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107b0f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:40:45, skipping insertion in model container [2018-02-02 18:40:45,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:40:45" (3/3) ... [2018-02-02 18:40:45,051 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.0_true-valid-memsafety.i [2018-02-02 18:40:45,056 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:40:45,061 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 18:40:45,089 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:40:45,089 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:40:45,089 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:40:45,089 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:40:45,090 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:40:45,090 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:40:45,090 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:40:45,090 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:40:45,091 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:40:45,102 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-02 18:40:45,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-02 18:40:45,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:45,110 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:45,110 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:45,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-02 18:40:45,116 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:45,116 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:45,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,159 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:45,159 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:45,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:45,243 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-02 18:40:45,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:40:45,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:40:45,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 18:40:45,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 18:40:45,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 18:40:45,259 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-02 18:40:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:45,334 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-02 18:40:45,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 18:40:45,336 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-02 18:40:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:45,344 INFO L225 Difference]: With dead ends: 76 [2018-02-02 18:40:45,344 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 18:40:45,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 18:40:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 18:40:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-02 18:40:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 18:40:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-02 18:40:45,368 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-02 18:40:45,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:45,368 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-02 18:40:45,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 18:40:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-02 18:40:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 18:40:45,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:45,369 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:45,369 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:45,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-02 18:40:45,369 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:45,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:45,370 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,370 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:45,370 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:45,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:45,419 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-02 18:40:45,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:40:45,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:40:45,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:40:45,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:40:45,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:40:45,421 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-02 18:40:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:45,443 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-02 18:40:45,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:40:45,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 18:40:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:45,446 INFO L225 Difference]: With dead ends: 74 [2018-02-02 18:40:45,446 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 18:40:45,447 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-02 18:40:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 18:40:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-02 18:40:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 18:40:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-02 18:40:45,453 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-02 18:40:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:45,453 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-02 18:40:45,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:40:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-02 18:40:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 18:40:45,454 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:45,454 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:45,454 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-02 18:40:45,455 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:45,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:45,455 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,455 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:45,456 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:45,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:45,526 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-02 18:40:45,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:40:45,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:40:45,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:40:45,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:40:45,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:40:45,529 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-02 18:40:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:45,552 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-02 18:40:45,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:40:45,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 18:40:45,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:45,553 INFO L225 Difference]: With dead ends: 132 [2018-02-02 18:40:45,554 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 18:40:45,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:40:45,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 18:40:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-02 18:40:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 18:40:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-02 18:40:45,568 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-02 18:40:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:45,568 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-02 18:40:45,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:40:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-02 18:40:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 18:40:45,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:45,569 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:45,569 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:45,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-02 18:40:45,569 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:45,569 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:45,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,570 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:45,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:45,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:45,597 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-02 18:40:45,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:40:45,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:40:45,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:40:45,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:40:45,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:40:45,598 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-02 18:40:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:45,648 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-02 18:40:45,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:40:45,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-02 18:40:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:45,651 INFO L225 Difference]: With dead ends: 147 [2018-02-02 18:40:45,651 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 18:40:45,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:40:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 18:40:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-02 18:40:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 18:40:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-02 18:40:45,660 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-02 18:40:45,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:45,660 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-02 18:40:45,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:40:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-02 18:40:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 18:40:45,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:45,661 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:45,661 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:45,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-02 18:40:45,661 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:45,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:45,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,662 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:45,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:45,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:45,712 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-02 18:40:45,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:40:45,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:40:45,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:40:45,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:40:45,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:40:45,713 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-02 18:40:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:45,788 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-02 18:40:45,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:40:45,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 18:40:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:45,791 INFO L225 Difference]: With dead ends: 255 [2018-02-02 18:40:45,791 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 18:40:45,791 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:40:45,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 18:40:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-02 18:40:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 18:40:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-02 18:40:45,805 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-02 18:40:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:45,805 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-02 18:40:45,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:40:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-02 18:40:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:40:45,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:45,806 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:45,806 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:45,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-02 18:40:45,807 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:45,807 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:45,808 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,808 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:45,808 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:45,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:45,839 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-02 18:40:45,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:40:45,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:40:45,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:40:45,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:40:45,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:40:45,840 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-02 18:40:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:45,929 INFO L93 Difference]: Finished difference Result 388 states and 570 transitions. [2018-02-02 18:40:45,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:40:45,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 18:40:45,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:45,933 INFO L225 Difference]: With dead ends: 388 [2018-02-02 18:40:45,933 INFO L226 Difference]: Without dead ends: 388 [2018-02-02 18:40:45,933 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-02 18:40:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-02 18:40:45,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 358. [2018-02-02 18:40:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-02 18:40:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-02 18:40:45,950 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-02 18:40:45,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:45,950 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-02 18:40:45,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:40:45,951 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-02 18:40:45,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:40:45,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:45,951 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:45,951 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:45,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-02 18:40:45,952 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:45,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:45,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,953 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:45,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:45,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:46,001 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-02 18:40:46,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:40:46,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:40:46,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:40:46,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:40:46,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:40:46,002 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-02 18:40:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:46,070 INFO L93 Difference]: Finished difference Result 487 states and 717 transitions. [2018-02-02 18:40:46,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:40:46,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 18:40:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:46,073 INFO L225 Difference]: With dead ends: 487 [2018-02-02 18:40:46,074 INFO L226 Difference]: Without dead ends: 487 [2018-02-02 18:40:46,074 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-02 18:40:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-02-02 18:40:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 460. [2018-02-02 18:40:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-02 18:40:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-02 18:40:46,088 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-02 18:40:46,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:46,088 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-02 18:40:46,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:40:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-02 18:40:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:40:46,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:46,089 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:46,089 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:46,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-02 18:40:46,090 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:46,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:46,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:46,091 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:46,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:46,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:46,121 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-02 18:40:46,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:40:46,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:40:46,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:40:46,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:40:46,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:40:46,122 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-02 18:40:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:46,175 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-02 18:40:46,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:40:46,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 18:40:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:46,181 INFO L225 Difference]: With dead ends: 861 [2018-02-02 18:40:46,181 INFO L226 Difference]: Without dead ends: 861 [2018-02-02 18:40:46,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:40:46,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-02 18:40:46,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-02 18:40:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-02 18:40:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-02 18:40:46,211 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-02 18:40:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:46,211 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-02 18:40:46,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:40:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-02 18:40:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 18:40:46,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:46,213 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:46,213 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:46,213 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-02 18:40:46,213 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:46,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:46,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:46,214 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:46,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:46,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:40:46,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:40:46,272 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-02 18:40:46,283 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:46,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:46,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:40:46,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:40:46,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-02-02 18:40:46,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:40:46,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:40:46,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:40:46,457 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 9 states. [2018-02-02 18:40:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:46,798 INFO L93 Difference]: Finished difference Result 1420 states and 2030 transitions. [2018-02-02 18:40:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 18:40:46,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 18:40:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:46,804 INFO L225 Difference]: With dead ends: 1420 [2018-02-02 18:40:46,804 INFO L226 Difference]: Without dead ends: 1420 [2018-02-02 18:40:46,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-02-02 18:40:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-02-02 18:40:46,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1268. [2018-02-02 18:40:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-02-02 18:40:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1792 transitions. [2018-02-02 18:40:46,843 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1792 transitions. Word has length 26 [2018-02-02 18:40:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:46,843 INFO L432 AbstractCegarLoop]: Abstraction has 1268 states and 1792 transitions. [2018-02-02 18:40:46,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:40:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1792 transitions. [2018-02-02 18:40:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:40:46,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:46,844 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] [2018-02-02 18:40:46,844 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:46,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-02 18:40:46,845 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:46,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:46,847 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:46,847 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:46,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:46,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:40:46,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:40:46,946 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-02 18:40:46,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:46,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:40:47,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:40:47,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2018-02-02 18:40:47,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:40:47,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:40:47,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:40:47,038 INFO L87 Difference]: Start difference. First operand 1268 states and 1792 transitions. Second operand 12 states. [2018-02-02 18:40:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:48,252 INFO L93 Difference]: Finished difference Result 5557 states and 8776 transitions. [2018-02-02 18:40:48,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-02 18:40:48,253 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-02-02 18:40:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:48,279 INFO L225 Difference]: With dead ends: 5557 [2018-02-02 18:40:48,280 INFO L226 Difference]: Without dead ends: 5557 [2018-02-02 18:40:48,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=648, Invalid=3012, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 18:40:48,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2018-02-02 18:40:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 4580. [2018-02-02 18:40:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4580 states. [2018-02-02 18:40:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4580 states to 4580 states and 6778 transitions. [2018-02-02 18:40:48,439 INFO L78 Accepts]: Start accepts. Automaton has 4580 states and 6778 transitions. Word has length 27 [2018-02-02 18:40:48,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:48,440 INFO L432 AbstractCegarLoop]: Abstraction has 4580 states and 6778 transitions. [2018-02-02 18:40:48,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:40:48,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4580 states and 6778 transitions. [2018-02-02 18:40:48,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 18:40:48,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:48,441 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:48,441 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:48,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-02 18:40:48,442 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:48,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:48,443 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:48,443 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:48,443 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:48,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:40:48,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:40:48,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:40:48,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:40:48,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:40:48,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:40:48,511 INFO L87 Difference]: Start difference. First operand 4580 states and 6778 transitions. Second operand 7 states. [2018-02-02 18:40:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:48,677 INFO L93 Difference]: Finished difference Result 2062 states and 2588 transitions. [2018-02-02 18:40:48,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:40:48,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-02 18:40:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:48,684 INFO L225 Difference]: With dead ends: 2062 [2018-02-02 18:40:48,684 INFO L226 Difference]: Without dead ends: 1630 [2018-02-02 18:40:48,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:40:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2018-02-02 18:40:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1495. [2018-02-02 18:40:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2018-02-02 18:40:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1981 transitions. [2018-02-02 18:40:48,718 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1981 transitions. Word has length 31 [2018-02-02 18:40:48,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:48,718 INFO L432 AbstractCegarLoop]: Abstraction has 1495 states and 1981 transitions. [2018-02-02 18:40:48,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:40:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1981 transitions. [2018-02-02 18:40:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:40:48,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:48,719 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:48,719 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:48,720 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-02 18:40:48,720 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:48,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:48,720 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:48,720 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:48,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:48,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:40:48,805 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:40:48,805 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-02 18:40:48,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:48,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 18:40:48,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:40:48,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-02-02 18:40:48,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:40:48,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:40:48,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:40:48,918 INFO L87 Difference]: Start difference. First operand 1495 states and 1981 transitions. Second operand 10 states. [2018-02-02 18:40:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:49,437 INFO L93 Difference]: Finished difference Result 2257 states and 3011 transitions. [2018-02-02 18:40:49,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:40:49,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-02 18:40:49,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:49,446 INFO L225 Difference]: With dead ends: 2257 [2018-02-02 18:40:49,446 INFO L226 Difference]: Without dead ends: 2257 [2018-02-02 18:40:49,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-02-02 18:40:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2018-02-02 18:40:49,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2011. [2018-02-02 18:40:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2018-02-02 18:40:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2653 transitions. [2018-02-02 18:40:49,487 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2653 transitions. Word has length 38 [2018-02-02 18:40:49,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:49,488 INFO L432 AbstractCegarLoop]: Abstraction has 2011 states and 2653 transitions. [2018-02-02 18:40:49,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:40:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2653 transitions. [2018-02-02 18:40:49,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 18:40:49,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:49,489 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:49,489 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:49,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1056748287, now seen corresponding path program 1 times [2018-02-02 18:40:49,489 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:49,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:49,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:49,490 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:49,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:49,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 18:40:49,588 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:40:49,588 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-02 18:40:49,594 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:49,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 18:40:49,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:40:49,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-02-02 18:40:49,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 18:40:49,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 18:40:49,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-02 18:40:49,795 INFO L87 Difference]: Start difference. First operand 2011 states and 2653 transitions. Second operand 16 states. [2018-02-02 18:40:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:50,628 INFO L93 Difference]: Finished difference Result 1629 states and 2030 transitions. [2018-02-02 18:40:50,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 18:40:50,628 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-02 18:40:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:50,633 INFO L225 Difference]: With dead ends: 1629 [2018-02-02 18:40:50,633 INFO L226 Difference]: Without dead ends: 1575 [2018-02-02 18:40:50,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=341, Invalid=1465, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 18:40:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2018-02-02 18:40:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1325. [2018-02-02 18:40:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2018-02-02 18:40:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1656 transitions. [2018-02-02 18:40:50,661 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1656 transitions. Word has length 41 [2018-02-02 18:40:50,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:50,661 INFO L432 AbstractCegarLoop]: Abstraction has 1325 states and 1656 transitions. [2018-02-02 18:40:50,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 18:40:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1656 transitions. [2018-02-02 18:40:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 18:40:50,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:50,662 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:50,662 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:50,663 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-02 18:40:50,663 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:50,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:50,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:50,664 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:50,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:50,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 18:40:50,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:40:50,767 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-02 18:40:50,776 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:50,822 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:40:50,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:40:50,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2018-02-02 18:40:50,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 18:40:50,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 18:40:50,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-02 18:40:50,899 INFO L87 Difference]: Start difference. First operand 1325 states and 1656 transitions. Second operand 14 states. [2018-02-02 18:40:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:51,437 INFO L93 Difference]: Finished difference Result 1879 states and 2408 transitions. [2018-02-02 18:40:51,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 18:40:51,438 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-02-02 18:40:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:51,443 INFO L225 Difference]: With dead ends: 1879 [2018-02-02 18:40:51,443 INFO L226 Difference]: Without dead ends: 1879 [2018-02-02 18:40:51,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=345, Invalid=1377, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 18:40:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2018-02-02 18:40:51,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1698. [2018-02-02 18:40:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1698 states. [2018-02-02 18:40:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2143 transitions. [2018-02-02 18:40:51,466 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2143 transitions. Word has length 42 [2018-02-02 18:40:51,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:51,466 INFO L432 AbstractCegarLoop]: Abstraction has 1698 states and 2143 transitions. [2018-02-02 18:40:51,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 18:40:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2143 transitions. [2018-02-02 18:40:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:40:51,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:51,467 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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-02 18:40:51,467 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:51,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-02 18:40:51,468 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:51,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:51,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:51,468 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:51,469 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:51,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:51,527 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 18:40:51,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:40:51,527 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-02 18:40:51,535 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:51,583 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:51,644 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 18:40:51,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:40:51,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-02 18:40:51,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:40:51,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:40:51,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:40:51,679 INFO L87 Difference]: Start difference. First operand 1698 states and 2143 transitions. Second operand 11 states. [2018-02-02 18:40:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:51,907 INFO L93 Difference]: Finished difference Result 2234 states and 2922 transitions. [2018-02-02 18:40:51,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:40:51,907 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-02 18:40:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:51,916 INFO L225 Difference]: With dead ends: 2234 [2018-02-02 18:40:51,917 INFO L226 Difference]: Without dead ends: 2234 [2018-02-02 18:40:51,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-02-02 18:40:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2018-02-02 18:40:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1742. [2018-02-02 18:40:51,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2018-02-02 18:40:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2209 transitions. [2018-02-02 18:40:51,952 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2209 transitions. Word has length 54 [2018-02-02 18:40:51,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:51,953 INFO L432 AbstractCegarLoop]: Abstraction has 1742 states and 2209 transitions. [2018-02-02 18:40:51,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:40:51,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2209 transitions. [2018-02-02 18:40:51,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:40:51,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:51,954 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2018-02-02 18:40:51,954 INFO L371 AbstractCegarLoop]: === Iteration 16 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:51,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-02 18:40:51,954 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:51,954 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:51,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:51,955 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:51,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:51,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 18:40:52,028 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:40:52,029 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-02 18:40:52,036 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:52,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 18:40:52,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:40:52,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-02-02 18:40:52,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:40:52,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:40:52,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:40:52,172 INFO L87 Difference]: Start difference. First operand 1742 states and 2209 transitions. Second operand 15 states. [2018-02-02 18:40:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:52,529 INFO L93 Difference]: Finished difference Result 2927 states and 3893 transitions. [2018-02-02 18:40:52,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 18:40:52,538 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-02 18:40:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:52,548 INFO L225 Difference]: With dead ends: 2927 [2018-02-02 18:40:52,548 INFO L226 Difference]: Without dead ends: 2877 [2018-02-02 18:40:52,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 18:40:52,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2018-02-02 18:40:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2379. [2018-02-02 18:40:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2018-02-02 18:40:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3045 transitions. [2018-02-02 18:40:52,597 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3045 transitions. Word has length 54 [2018-02-02 18:40:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:52,598 INFO L432 AbstractCegarLoop]: Abstraction has 2379 states and 3045 transitions. [2018-02-02 18:40:52,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:40:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3045 transitions. [2018-02-02 18:40:52,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 18:40:52,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:52,599 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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-02 18:40:52,599 INFO L371 AbstractCegarLoop]: === Iteration 17 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:52,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-02-02 18:40:52,600 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:52,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:52,600 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:52,601 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:52,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:52,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 18:40:52,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:40:52,688 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-02 18:40:52,696 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:52,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 18:40:52,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:40:52,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-02 18:40:52,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:40:52,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:40:52,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:40:52,820 INFO L87 Difference]: Start difference. First operand 2379 states and 3045 transitions. Second operand 11 states. [2018-02-02 18:40:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:53,052 INFO L93 Difference]: Finished difference Result 2871 states and 3733 transitions. [2018-02-02 18:40:53,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:40:53,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-02 18:40:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:53,063 INFO L225 Difference]: With dead ends: 2871 [2018-02-02 18:40:53,064 INFO L226 Difference]: Without dead ends: 2871 [2018-02-02 18:40:53,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-02-02 18:40:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2018-02-02 18:40:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2840. [2018-02-02 18:40:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2840 states. [2018-02-02 18:40:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 3705 transitions. [2018-02-02 18:40:53,124 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 3705 transitions. Word has length 68 [2018-02-02 18:40:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:53,125 INFO L432 AbstractCegarLoop]: Abstraction has 2840 states and 3705 transitions. [2018-02-02 18:40:53,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:40:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3705 transitions. [2018-02-02 18:40:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 18:40:53,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:53,126 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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-02 18:40:53,126 INFO L371 AbstractCegarLoop]: === Iteration 18 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:53,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-02-02 18:40:53,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:53,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:53,128 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:53,128 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:53,128 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:53,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 18:40:53,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:40:53,276 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:40:53,283 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:53,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 18:40:53,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:40:53,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-02-02 18:40:53,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 18:40:53,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 18:40:53,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-02 18:40:53,497 INFO L87 Difference]: Start difference. First operand 2840 states and 3705 transitions. Second operand 18 states. [2018-02-02 18:40:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:54,255 INFO L93 Difference]: Finished difference Result 4967 states and 6586 transitions. [2018-02-02 18:40:54,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 18:40:54,256 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-02-02 18:40:54,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:54,270 INFO L225 Difference]: With dead ends: 4967 [2018-02-02 18:40:54,270 INFO L226 Difference]: Without dead ends: 4901 [2018-02-02 18:40:54,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 18:40:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2018-02-02 18:40:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 3647. [2018-02-02 18:40:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3647 states. [2018-02-02 18:40:54,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 4689 transitions. [2018-02-02 18:40:54,325 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 4689 transitions. Word has length 70 [2018-02-02 18:40:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:54,326 INFO L432 AbstractCegarLoop]: Abstraction has 3647 states and 4689 transitions. [2018-02-02 18:40:54,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 18:40:54,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 4689 transitions. [2018-02-02 18:40:54,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 18:40:54,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:54,327 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:54,327 INFO L371 AbstractCegarLoop]: === Iteration 19 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:54,328 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-02-02 18:40:54,328 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:54,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:54,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:54,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:54,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:54,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 18:40:54,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:40:54,493 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:40:54,501 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:54,560 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-02-02 18:40:54,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:40:54,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-02 18:40:54,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 18:40:54,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 18:40:54,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 18:40:54,679 INFO L87 Difference]: Start difference. First operand 3647 states and 4689 transitions. Second operand 17 states. [2018-02-02 18:40:55,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:55,256 INFO L93 Difference]: Finished difference Result 4854 states and 6361 transitions. [2018-02-02 18:40:55,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 18:40:55,256 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-02-02 18:40:55,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:55,266 INFO L225 Difference]: With dead ends: 4854 [2018-02-02 18:40:55,266 INFO L226 Difference]: Without dead ends: 4760 [2018-02-02 18:40:55,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 18:40:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2018-02-02 18:40:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 3571. [2018-02-02 18:40:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3571 states. [2018-02-02 18:40:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 4537 transitions. [2018-02-02 18:40:55,336 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 4537 transitions. Word has length 84 [2018-02-02 18:40:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:55,337 INFO L432 AbstractCegarLoop]: Abstraction has 3571 states and 4537 transitions. [2018-02-02 18:40:55,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 18:40:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 4537 transitions. [2018-02-02 18:40:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 18:40:55,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:55,338 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:55,339 INFO L371 AbstractCegarLoop]: === Iteration 20 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:55,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-02-02 18:40:55,339 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:55,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:55,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:55,340 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:55,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:55,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 40 proven. 64 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 18:40:55,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:40:55,452 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:40:55,459 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:55,515 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 101 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 18:40:55,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:40:55,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-02-02 18:40:55,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 18:40:55,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 18:40:55,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-02 18:40:55,655 INFO L87 Difference]: Start difference. First operand 3571 states and 4537 transitions. Second operand 17 states. [2018-02-02 18:40:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:56,982 INFO L93 Difference]: Finished difference Result 8315 states and 10595 transitions. [2018-02-02 18:40:56,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-02 18:40:56,982 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-02-02 18:40:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:57,000 INFO L225 Difference]: With dead ends: 8315 [2018-02-02 18:40:57,000 INFO L226 Difference]: Without dead ends: 8227 [2018-02-02 18:40:57,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2062 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1105, Invalid=5537, Unknown=0, NotChecked=0, Total=6642 [2018-02-02 18:40:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8227 states. [2018-02-02 18:40:57,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8227 to 7332. [2018-02-02 18:40:57,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7332 states. [2018-02-02 18:40:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7332 states to 7332 states and 9345 transitions. [2018-02-02 18:40:57,080 INFO L78 Accepts]: Start accepts. Automaton has 7332 states and 9345 transitions. Word has length 87 [2018-02-02 18:40:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:57,080 INFO L432 AbstractCegarLoop]: Abstraction has 7332 states and 9345 transitions. [2018-02-02 18:40:57,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 18:40:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 7332 states and 9345 transitions. [2018-02-02 18:40:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 18:40:57,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:57,082 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:57,082 INFO L371 AbstractCegarLoop]: === Iteration 21 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:40:57,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1189470598, now seen corresponding path program 1 times [2018-02-02 18:40:57,083 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:57,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:57,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:57,083 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:57,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:57,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:40:57,207 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-02-02 18:40:57,207 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:40:57,207 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:40:57,215 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:40:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:40:57,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 81 proven. 41 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 18:40:57,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:40:57,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-02-02 18:40:57,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 18:40:57,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 18:40:57,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-02-02 18:40:57,375 INFO L87 Difference]: Start difference. First operand 7332 states and 9345 transitions. Second operand 20 states. [2018-02-02 18:41:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:02,239 INFO L93 Difference]: Finished difference Result 21939 states and 28417 transitions. [2018-02-02 18:41:02,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-02-02 18:41:02,240 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-02-02 18:41:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:02,285 INFO L225 Difference]: With dead ends: 21939 [2018-02-02 18:41:02,285 INFO L226 Difference]: Without dead ends: 21708 [2018-02-02 18:41:02,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15935 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4644, Invalid=34362, Unknown=0, NotChecked=0, Total=39006 [2018-02-02 18:41:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21708 states. [2018-02-02 18:41:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21708 to 17569. [2018-02-02 18:41:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17569 states. [2018-02-02 18:41:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17569 states to 17569 states and 22556 transitions. [2018-02-02 18:41:02,566 INFO L78 Accepts]: Start accepts. Automaton has 17569 states and 22556 transitions. Word has length 99 [2018-02-02 18:41:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:02,567 INFO L432 AbstractCegarLoop]: Abstraction has 17569 states and 22556 transitions. [2018-02-02 18:41:02,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 18:41:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 17569 states and 22556 transitions. [2018-02-02 18:41:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 18:41:02,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:02,571 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2018-02-02 18:41:02,571 INFO L371 AbstractCegarLoop]: === Iteration 22 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:41:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1793769950, now seen corresponding path program 1 times [2018-02-02 18:41:02,571 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:02,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:02,572 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:02,572 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:02,572 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:02,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-02 18:41:02,810 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:02,810 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:02,815 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:02,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 53 proven. 89 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-02 18:41:03,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:03,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-02-02 18:41:03,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 18:41:03,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 18:41:03,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 18:41:03,096 INFO L87 Difference]: Start difference. First operand 17569 states and 22556 transitions. Second operand 20 states. [2018-02-02 18:41:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:04,756 INFO L93 Difference]: Finished difference Result 26060 states and 33480 transitions. [2018-02-02 18:41:04,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 18:41:04,758 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 105 [2018-02-02 18:41:04,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:04,820 INFO L225 Difference]: With dead ends: 26060 [2018-02-02 18:41:04,820 INFO L226 Difference]: Without dead ends: 26060 [2018-02-02 18:41:04,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 110 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=450, Invalid=2000, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 18:41:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26060 states. [2018-02-02 18:41:05,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26060 to 25197. [2018-02-02 18:41:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25197 states. [2018-02-02 18:41:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25197 states to 25197 states and 32302 transitions. [2018-02-02 18:41:05,160 INFO L78 Accepts]: Start accepts. Automaton has 25197 states and 32302 transitions. Word has length 105 [2018-02-02 18:41:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:05,160 INFO L432 AbstractCegarLoop]: Abstraction has 25197 states and 32302 transitions. [2018-02-02 18:41:05,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 18:41:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 25197 states and 32302 transitions. [2018-02-02 18:41:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-02-02 18:41:05,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:05,166 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 8, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:05,166 INFO L371 AbstractCegarLoop]: === Iteration 23 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:41:05,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1854918738, now seen corresponding path program 1 times [2018-02-02 18:41:05,167 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:05,167 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:05,167 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:05,168 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:05,168 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:05,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-02-02 18:41:05,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:41:05,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:41:05,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:41:05,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:41:05,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:41:05,253 INFO L87 Difference]: Start difference. First operand 25197 states and 32302 transitions. Second operand 6 states. [2018-02-02 18:41:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:05,412 INFO L93 Difference]: Finished difference Result 32951 states and 43782 transitions. [2018-02-02 18:41:05,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:41:05,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-02-02 18:41:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:05,499 INFO L225 Difference]: With dead ends: 32951 [2018-02-02 18:41:05,499 INFO L226 Difference]: Without dead ends: 32951 [2018-02-02 18:41:05,499 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:41:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32951 states. [2018-02-02 18:41:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32951 to 32933. [2018-02-02 18:41:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32933 states. [2018-02-02 18:41:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32933 states to 32933 states and 43766 transitions. [2018-02-02 18:41:05,958 INFO L78 Accepts]: Start accepts. Automaton has 32933 states and 43766 transitions. Word has length 131 [2018-02-02 18:41:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:05,959 INFO L432 AbstractCegarLoop]: Abstraction has 32933 states and 43766 transitions. [2018-02-02 18:41:05,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:41:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 32933 states and 43766 transitions. [2018-02-02 18:41:05,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-02 18:41:05,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:05,964 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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] [2018-02-02 18:41:05,964 INFO L371 AbstractCegarLoop]: === Iteration 24 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:41:05,964 INFO L82 PathProgramCache]: Analyzing trace with hash 970215073, now seen corresponding path program 1 times [2018-02-02 18:41:05,965 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:05,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:05,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:05,965 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:05,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:05,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 69 proven. 127 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-02-02 18:41:06,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:06,128 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:06,137 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:06,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 210 proven. 4 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-02-02 18:41:06,336 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:06,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-02-02 18:41:06,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 18:41:06,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 18:41:06,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 18:41:06,337 INFO L87 Difference]: Start difference. First operand 32933 states and 43766 transitions. Second operand 18 states. [2018-02-02 18:41:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:10,132 INFO L93 Difference]: Finished difference Result 82036 states and 106210 transitions. [2018-02-02 18:41:10,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-02-02 18:41:10,132 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 141 [2018-02-02 18:41:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:10,283 INFO L225 Difference]: With dead ends: 82036 [2018-02-02 18:41:10,284 INFO L226 Difference]: Without dead ends: 81100 [2018-02-02 18:41:10,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8443 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2717, Invalid=18745, Unknown=0, NotChecked=0, Total=21462 [2018-02-02 18:41:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81100 states. [2018-02-02 18:41:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81100 to 65942. [2018-02-02 18:41:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65942 states. [2018-02-02 18:41:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65942 states to 65942 states and 85635 transitions. [2018-02-02 18:41:11,061 INFO L78 Accepts]: Start accepts. Automaton has 65942 states and 85635 transitions. Word has length 141 [2018-02-02 18:41:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:11,062 INFO L432 AbstractCegarLoop]: Abstraction has 65942 states and 85635 transitions. [2018-02-02 18:41:11,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 18:41:11,062 INFO L276 IsEmpty]: Start isEmpty. Operand 65942 states and 85635 transitions. [2018-02-02 18:41:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-02-02 18:41:11,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:11,069 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 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-02 18:41:11,069 INFO L371 AbstractCegarLoop]: === Iteration 25 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:41:11,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1022004672, now seen corresponding path program 1 times [2018-02-02 18:41:11,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:11,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:11,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:11,070 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:11,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:11,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 203 proven. 11 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-02-02 18:41:11,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:11,161 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:11,166 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:11,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 225 proven. 10 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2018-02-02 18:41:11,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:11,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 14 [2018-02-02 18:41:11,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 18:41:11,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 18:41:11,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-02 18:41:11,319 INFO L87 Difference]: Start difference. First operand 65942 states and 85635 transitions. Second operand 14 states. [2018-02-02 18:41:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:12,065 INFO L93 Difference]: Finished difference Result 63292 states and 81823 transitions. [2018-02-02 18:41:12,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 18:41:12,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2018-02-02 18:41:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:12,197 INFO L225 Difference]: With dead ends: 63292 [2018-02-02 18:41:12,197 INFO L226 Difference]: Without dead ends: 62536 [2018-02-02 18:41:12,197 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 18:41:12,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62536 states. [2018-02-02 18:41:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62536 to 56204. [2018-02-02 18:41:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56204 states. [2018-02-02 18:41:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56204 states to 56204 states and 71115 transitions. [2018-02-02 18:41:12,744 INFO L78 Accepts]: Start accepts. Automaton has 56204 states and 71115 transitions. Word has length 155 [2018-02-02 18:41:12,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:12,744 INFO L432 AbstractCegarLoop]: Abstraction has 56204 states and 71115 transitions. [2018-02-02 18:41:12,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 18:41:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 56204 states and 71115 transitions. [2018-02-02 18:41:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-02 18:41:12,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:12,751 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1] [2018-02-02 18:41:12,752 INFO L371 AbstractCegarLoop]: === Iteration 26 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:41:12,752 INFO L82 PathProgramCache]: Analyzing trace with hash 61686075, now seen corresponding path program 1 times [2018-02-02 18:41:12,752 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:12,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:12,752 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:12,752 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:12,752 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:12,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 126 proven. 7 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-02-02 18:41:12,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:12,847 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:12,857 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:12,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 126 proven. 7 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-02-02 18:41:13,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:13,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-02 18:41:13,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:41:13,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:41:13,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:41:13,186 INFO L87 Difference]: Start difference. First operand 56204 states and 71115 transitions. Second operand 11 states. [2018-02-02 18:41:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:13,502 INFO L93 Difference]: Finished difference Result 35192 states and 44591 transitions. [2018-02-02 18:41:13,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 18:41:13,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2018-02-02 18:41:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:13,559 INFO L225 Difference]: With dead ends: 35192 [2018-02-02 18:41:13,559 INFO L226 Difference]: Without dead ends: 34706 [2018-02-02 18:41:13,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-02-02 18:41:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34706 states. [2018-02-02 18:41:13,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34706 to 32681. [2018-02-02 18:41:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32681 states. [2018-02-02 18:41:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32681 states to 32681 states and 40799 transitions. [2018-02-02 18:41:13,845 INFO L78 Accepts]: Start accepts. Automaton has 32681 states and 40799 transitions. Word has length 159 [2018-02-02 18:41:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:13,846 INFO L432 AbstractCegarLoop]: Abstraction has 32681 states and 40799 transitions. [2018-02-02 18:41:13,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:41:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 32681 states and 40799 transitions. [2018-02-02 18:41:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-02 18:41:13,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:13,853 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:13,853 INFO L371 AbstractCegarLoop]: === Iteration 27 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:41:13,853 INFO L82 PathProgramCache]: Analyzing trace with hash 50496070, now seen corresponding path program 1 times [2018-02-02 18:41:13,853 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:13,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:13,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:13,854 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:13,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:13,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 162 proven. 14 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2018-02-02 18:41:13,935 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:13,935 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:13,942 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:14,034 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 146 proven. 218 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-02-02 18:41:14,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:14,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12] total 14 [2018-02-02 18:41:14,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:41:14,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:41:14,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:41:14,247 INFO L87 Difference]: Start difference. First operand 32681 states and 40799 transitions. Second operand 15 states. [2018-02-02 18:41:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:16,123 INFO L93 Difference]: Finished difference Result 35263 states and 44006 transitions. [2018-02-02 18:41:16,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 18:41:16,124 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 162 [2018-02-02 18:41:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:16,180 INFO L225 Difference]: With dead ends: 35263 [2018-02-02 18:41:16,180 INFO L226 Difference]: Without dead ends: 35263 [2018-02-02 18:41:16,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 162 SyntacticMatches, 10 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=776, Invalid=3384, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 18:41:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35263 states. [2018-02-02 18:41:16,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35263 to 32683. [2018-02-02 18:41:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32683 states. [2018-02-02 18:41:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32683 states to 32683 states and 40803 transitions. [2018-02-02 18:41:16,468 INFO L78 Accepts]: Start accepts. Automaton has 32683 states and 40803 transitions. Word has length 162 [2018-02-02 18:41:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:16,468 INFO L432 AbstractCegarLoop]: Abstraction has 32683 states and 40803 transitions. [2018-02-02 18:41:16,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:41:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 32683 states and 40803 transitions. [2018-02-02 18:41:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-02 18:41:16,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:16,476 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:16,476 INFO L371 AbstractCegarLoop]: === Iteration 28 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:41:16,476 INFO L82 PathProgramCache]: Analyzing trace with hash 50496071, now seen corresponding path program 1 times [2018-02-02 18:41:16,476 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:16,476 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:16,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:16,477 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:16,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:16,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 69 proven. 272 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-02 18:41:16,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:16,736 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:16,744 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:16,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 81 proven. 260 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-02 18:41:17,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:17,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2018-02-02 18:41:17,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 18:41:17,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 18:41:17,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2018-02-02 18:41:17,138 INFO L87 Difference]: Start difference. First operand 32683 states and 40803 transitions. Second operand 25 states. [2018-02-02 18:41:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:22,008 INFO L93 Difference]: Finished difference Result 55586 states and 71561 transitions. [2018-02-02 18:41:22,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-02-02 18:41:22,008 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 162 [2018-02-02 18:41:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:22,103 INFO L225 Difference]: With dead ends: 55586 [2018-02-02 18:41:22,103 INFO L226 Difference]: Without dead ends: 55586 [2018-02-02 18:41:22,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 189 SyntacticMatches, 11 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5231 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2335, Invalid=12427, Unknown=0, NotChecked=0, Total=14762 [2018-02-02 18:41:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55586 states. [2018-02-02 18:41:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55586 to 46544. [2018-02-02 18:41:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46544 states. [2018-02-02 18:41:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46544 states to 46544 states and 58004 transitions. [2018-02-02 18:41:22,582 INFO L78 Accepts]: Start accepts. Automaton has 46544 states and 58004 transitions. Word has length 162 [2018-02-02 18:41:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:22,583 INFO L432 AbstractCegarLoop]: Abstraction has 46544 states and 58004 transitions. [2018-02-02 18:41:22,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 18:41:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 46544 states and 58004 transitions. [2018-02-02 18:41:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-02-02 18:41:22,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:22,590 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:22,590 INFO L371 AbstractCegarLoop]: === Iteration 29 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:41:22,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1565376607, now seen corresponding path program 1 times [2018-02-02 18:41:22,590 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:22,590 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:22,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:22,590 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:22,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:22,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 69 proven. 272 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-02 18:41:22,718 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:22,718 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:22,723 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:22,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 81 proven. 260 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-02 18:41:22,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:22,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-02-02 18:41:22,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 18:41:22,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 18:41:22,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 18:41:22,890 INFO L87 Difference]: Start difference. First operand 46544 states and 58004 transitions. Second operand 16 states. [2018-02-02 18:41:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:24,428 INFO L93 Difference]: Finished difference Result 46572 states and 57783 transitions. [2018-02-02 18:41:24,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-02 18:41:24,428 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 163 [2018-02-02 18:41:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:24,507 INFO L225 Difference]: With dead ends: 46572 [2018-02-02 18:41:24,507 INFO L226 Difference]: Without dead ends: 45580 [2018-02-02 18:41:24,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=835, Invalid=4715, Unknown=0, NotChecked=0, Total=5550 [2018-02-02 18:41:24,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45580 states. [2018-02-02 18:41:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45580 to 42846. [2018-02-02 18:41:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42846 states. [2018-02-02 18:41:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42846 states to 42846 states and 53267 transitions. [2018-02-02 18:41:24,885 INFO L78 Accepts]: Start accepts. Automaton has 42846 states and 53267 transitions. Word has length 163 [2018-02-02 18:41:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:24,886 INFO L432 AbstractCegarLoop]: Abstraction has 42846 states and 53267 transitions. [2018-02-02 18:41:24,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 18:41:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 42846 states and 53267 transitions. [2018-02-02 18:41:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-02 18:41:24,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:24,892 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:24,892 INFO L371 AbstractCegarLoop]: === Iteration 30 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:41:24,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1434737638, now seen corresponding path program 1 times [2018-02-02 18:41:24,892 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:24,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:24,893 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:24,893 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:24,893 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:24,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 66 proven. 290 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-02-02 18:41:25,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:25,497 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:25,502 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:25,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:25,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 18:41:25,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 10 treesize of output 9 [2018-02-02 18:41:25,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:25,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:25,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 18:41:25,912 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 10 treesize of output 9 [2018-02-02 18:41:25,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:25,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:25,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:25,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-02-02 18:41:25,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-02 18:41:26,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-02 18:41:26,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:41:26,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:41:26,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-02 18:41:26,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-02 18:41:26,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 18:41:26,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:41:26,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:41:26,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:16 [2018-02-02 18:41:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 72 proven. 309 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-02-02 18:41:26,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:26,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 34 [2018-02-02 18:41:26,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 18:41:26,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 18:41:26,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1029, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 18:41:26,118 INFO L87 Difference]: Start difference. First operand 42846 states and 53267 transitions. Second operand 34 states. [2018-02-02 18:41:28,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:28,947 INFO L93 Difference]: Finished difference Result 71201 states and 89730 transitions. [2018-02-02 18:41:28,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-02 18:41:28,947 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 168 [2018-02-02 18:41:28,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:29,074 INFO L225 Difference]: With dead ends: 71201 [2018-02-02 18:41:29,074 INFO L226 Difference]: Without dead ends: 71201 [2018-02-02 18:41:29,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 161 SyntacticMatches, 18 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2455 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1103, Invalid=7453, Unknown=0, NotChecked=0, Total=8556 [2018-02-02 18:41:29,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71201 states. [2018-02-02 18:41:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71201 to 65252. [2018-02-02 18:41:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65252 states. [2018-02-02 18:41:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65252 states to 65252 states and 81378 transitions. [2018-02-02 18:41:29,810 INFO L78 Accepts]: Start accepts. Automaton has 65252 states and 81378 transitions. Word has length 168 [2018-02-02 18:41:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:29,811 INFO L432 AbstractCegarLoop]: Abstraction has 65252 states and 81378 transitions. [2018-02-02 18:41:29,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 18:41:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 65252 states and 81378 transitions. [2018-02-02 18:41:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-02 18:41:29,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:29,819 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:29,819 INFO L371 AbstractCegarLoop]: === Iteration 31 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:41:29,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1527195381, now seen corresponding path program 1 times [2018-02-02 18:41:29,820 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:29,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:29,820 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:29,820 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:29,820 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:29,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 10 proven. 333 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-02 18:41:30,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:30,104 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:30,110 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:30,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:30,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:30,269 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 12 treesize of output 5 [2018-02-02 18:41:30,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:30,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:41:30,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-02 18:41:30,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:30,346 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 12 treesize of output 5 [2018-02-02 18:41:30,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:30,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:41:30,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-02 18:41:30,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:30,392 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 12 treesize of output 5 [2018-02-02 18:41:30,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:30,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:41:30,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-02 18:41:30,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:30,430 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 12 treesize of output 5 [2018-02-02 18:41:30,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:30,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:41:30,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-02 18:41:30,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:41:30,474 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 12 treesize of output 5 [2018-02-02 18:41:30,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:30,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:41:30,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-02 18:41:30,544 WARN L1033 $PredicateComparison]: unable to prove that (exists ((~garbage.base Int)) (and (= |c_#valid| (store |c_old(#valid)| ~garbage.base 0)) (not (= ~garbage.base 0)) (= 0 (select |c_old(#valid)| ~garbage.base)))) is different from true [2018-02-02 18:41:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 22 proven. 319 refuted. 0 times theorem prover too weak. 133 trivial. 2 not checked. [2018-02-02 18:41:30,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:30,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 26 [2018-02-02 18:41:30,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 18:41:30,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 18:41:30,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=586, Unknown=1, NotChecked=48, Total=702 [2018-02-02 18:41:30,596 INFO L87 Difference]: Start difference. First operand 65252 states and 81378 transitions. Second operand 27 states. [2018-02-02 18:41:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:41:33,420 INFO L93 Difference]: Finished difference Result 108116 states and 136485 transitions. [2018-02-02 18:41:33,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 18:41:33,420 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 169 [2018-02-02 18:41:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:41:33,613 INFO L225 Difference]: With dead ends: 108116 [2018-02-02 18:41:33,613 INFO L226 Difference]: Without dead ends: 108096 [2018-02-02 18:41:33,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 164 SyntacticMatches, 11 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=606, Invalid=4509, Unknown=1, NotChecked=140, Total=5256 [2018-02-02 18:41:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108096 states. [2018-02-02 18:41:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108096 to 102741. [2018-02-02 18:41:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102741 states. [2018-02-02 18:41:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102741 states to 102741 states and 129526 transitions. [2018-02-02 18:41:34,634 INFO L78 Accepts]: Start accepts. Automaton has 102741 states and 129526 transitions. Word has length 169 [2018-02-02 18:41:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:41:34,635 INFO L432 AbstractCegarLoop]: Abstraction has 102741 states and 129526 transitions. [2018-02-02 18:41:34,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 18:41:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 102741 states and 129526 transitions. [2018-02-02 18:41:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-02-02 18:41:34,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:41:34,643 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 8, 8, 8, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:41:34,643 INFO L371 AbstractCegarLoop]: === Iteration 32 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:41:34,643 INFO L82 PathProgramCache]: Analyzing trace with hash -427633868, now seen corresponding path program 1 times [2018-02-02 18:41:34,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:41:34,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:41:34,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:34,644 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:34,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:41:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:34,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:41:35,812 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 106 proven. 461 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-02-02 18:41:35,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:41:35,812 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:41:35,818 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:41:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:41:35,889 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:41:36,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 18:41:36,043 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 10 treesize of output 9 [2018-02-02 18:41:36,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:36,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:36,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 18:41:36,051 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 10 treesize of output 9 [2018-02-02 18:41:36,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:36,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:36,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:36,063 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-02-02 18:41:36,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-02 18:41:36,273 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:41:36,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-02 18:41:36,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:36,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:36,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-02 18:41:36,289 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:41:36,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-02 18:41:36,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:41:36,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:36,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:41:36,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:7 [2018-02-02 18:41:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 130 proven. 440 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 18:41:36,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:41:36,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 48 [2018-02-02 18:41:36,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 18:41:36,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 18:41:36,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2113, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 18:41:36,466 INFO L87 Difference]: Start difference. First operand 102741 states and 129526 transitions. Second operand 48 states. [2018-02-02 18:41:37,876 WARN L146 SmtUtils]: Spent 759ms on a formula simplification. DAG size of input: 87 DAG size of output 58 Received shutdown request... [2018-02-02 18:41:52,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-02-02 18:41:52,024 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:41:52,027 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:41:52,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:41:52 BoogieIcfgContainer [2018-02-02 18:41:52,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:41:52,028 INFO L168 Benchmark]: Toolchain (without parser) took 67449.44 ms. Allocated memory was 399.0 MB in the beginning and 2.7 GB in the end (delta: 2.3 GB). Free memory was 355.9 MB in the beginning and 1.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 952.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:41:52,029 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 399.0 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:41:52,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.36 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 345.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:41:52,029 INFO L168 Benchmark]: Boogie Preprocessor took 25.68 ms. Allocated memory is still 399.0 MB. Free memory was 345.3 MB in the beginning and 342.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:41:52,029 INFO L168 Benchmark]: RCFGBuilder took 285.91 ms. Allocated memory is still 399.0 MB. Free memory was 342.7 MB in the beginning and 315.4 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:41:52,029 INFO L168 Benchmark]: TraceAbstraction took 66980.45 ms. Allocated memory was 399.0 MB in the beginning and 2.7 GB in the end (delta: 2.3 GB). Free memory was 315.4 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 912.2 MB. Max. memory is 5.3 GB. [2018-02-02 18:41:52,030 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.14 ms. Allocated memory is still 399.0 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.36 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 345.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 25.68 ms. Allocated memory is still 399.0 MB. Free memory was 345.3 MB in the beginning and 342.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 285.91 ms. Allocated memory is still 399.0 MB. Free memory was 342.7 MB in the beginning and 315.4 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 66980.45 ms. Allocated memory was 399.0 MB in the beginning and 2.7 GB in the end (delta: 2.3 GB). Free memory was 315.4 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 912.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (102741states) and interpolant automaton (currently 179 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 77. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. TIMEOUT Result, 66.9s OverallTime, 32 OverallIterations, 13 TraceHistogramMax, 49.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4122 SDtfs, 24565 SDslu, 11399 SDs, 0 SdLazy, 42161 SolverSat, 8330 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4110 GetRequests, 2518 SyntacticMatches, 89 SemanticMatches, 1502 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 61181 ImplicationChecksByTransitivity, 30.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102741occurred in iteration=31, 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: 6.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 60640 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 4765 NumberOfCodeBlocks, 4765 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 4711 ConstructedInterpolants, 136 QuantifiedInterpolants, 3255135 SizeOfPredicates, 137 NumberOfNonLiveVariables, 14916 ConjunctsInSsa, 826 ConjunctsInUnsatCore, 54 InterpolantComputations, 12 PerfectInterpolantSequences, 6879/11024 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-41-52-035.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-41-52-035.csv Completed graceful shutdown