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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:55:34,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:55:34,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:55:34,742 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:55:34,743 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:55:34,743 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:55:34,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:55:34,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:55:34,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:55:34,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:55:34,750 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:55:34,750 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:55:34,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:55:34,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:55:34,752 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:55:34,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:55:34,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:55:34,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:55:34,760 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:55:34,761 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:55:34,764 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:55:34,764 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:55:34,764 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:55:34,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:55:34,766 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:55:34,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:55:34,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:55:34,770 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:55:34,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:55:34,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:55:34,771 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:55:34,772 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:55:34,782 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:55:34,783 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:55:34,783 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:55:34,784 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:55:34,784 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:55:34,784 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:55:34,784 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:55:34,785 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:55:34,785 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:55:34,785 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:55:34,786 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:55:34,786 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:55:34,786 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:55:34,786 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:55:34,786 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:55:34,786 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:55:34,787 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:55:34,787 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:55:34,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:55:34,787 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:55:34,788 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:55:34,788 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:55:34,788 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:55:34,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:55:34,788 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:55:34,789 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:55:34,789 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:55:34,789 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:55:34,789 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:55:34,789 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:55:34,789 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:55:34,790 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:55:34,792 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:55:34,793 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:55:34,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:55:34,851 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:55:34,855 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:55:34,857 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:55:34,857 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:55:34,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i [2018-01-24 11:55:35,022 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:55:35,028 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:55:35,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:55:35,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:55:35,035 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:55:35,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:55:35" (1/1) ... [2018-01-24 11:55:35,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee3542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:35, skipping insertion in model container [2018-01-24 11:55:35,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:55:35" (1/1) ... [2018-01-24 11:55:35,057 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:55:35,099 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:55:35,215 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:55:35,236 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:55:35,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:35 WrapperNode [2018-01-24 11:55:35,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:55:35,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:55:35,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:55:35,244 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:55:35,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:35" (1/1) ... [2018-01-24 11:55:35,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:35" (1/1) ... [2018-01-24 11:55:35,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:35" (1/1) ... [2018-01-24 11:55:35,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:35" (1/1) ... [2018-01-24 11:55:35,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:35" (1/1) ... [2018-01-24 11:55:35,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:35" (1/1) ... [2018-01-24 11:55:35,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:35" (1/1) ... [2018-01-24 11:55:35,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:55:35,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:55:35,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:55:35,293 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:55:35,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:35" (1/1) ... No working directory specified, using /storage/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-01-24 11:55:35,348 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:55:35,348 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:55:35,348 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-24 11:55:35,348 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-24 11:55:35,349 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:55:35,349 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:55:35,349 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:55:35,349 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 11:55:35,349 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 11:55:35,349 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:55:35,349 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:55:35,349 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:55:35,349 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 11:55:35,349 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 11:55:35,350 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:55:35,350 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-24 11:55:35,350 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-24 11:55:35,350 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:55:35,350 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:55:35,350 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:55:35,728 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:55:35,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:55:35 BoogieIcfgContainer [2018-01-24 11:55:35,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:55:35,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:55:35,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:55:35,731 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:55:35,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:55:35" (1/3) ... [2018-01-24 11:55:35,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601262f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:55:35, skipping insertion in model container [2018-01-24 11:55:35,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:55:35" (2/3) ... [2018-01-24 11:55:35,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601262f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:55:35, skipping insertion in model container [2018-01-24 11:55:35,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:55:35" (3/3) ... [2018-01-24 11:55:35,735 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-01-24 11:55:35,742 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:55:35,750 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 11:55:35,788 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:55:35,788 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:55:35,788 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:55:35,788 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:55:35,788 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:55:35,788 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:55:35,788 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:55:35,789 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:55:35,789 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:55:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 11:55:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-24 11:55:35,814 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:35,815 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:35,815 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-01-24 11:55:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-24 11:55:35,820 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:35,821 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:35,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:35,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:35,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:35,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:35,982 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:35,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:55:35,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 11:55:36,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 11:55:36,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 11:55:36,006 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-24 11:55:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:36,126 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-24 11:55:36,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 11:55:36,128 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-24 11:55:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:36,144 INFO L225 Difference]: With dead ends: 92 [2018-01-24 11:55:36,144 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 11:55:36,148 INFO L525 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-01-24 11:55:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 11:55:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 11:55:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 11:55:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-24 11:55:36,184 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-24 11:55:36,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:36,184 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-24 11:55:36,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 11:55:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-24 11:55:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 11:55:36,185 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:36,185 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:36,185 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-01-24 11:55:36,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-24 11:55:36,185 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:36,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:36,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:36,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:36,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:36,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:36,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:36,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:55:36,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:55:36,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:55:36,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:55:36,259 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-24 11:55:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:36,284 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-24 11:55:36,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:55:36,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 11:55:36,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:36,286 INFO L225 Difference]: With dead ends: 87 [2018-01-24 11:55:36,286 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 11:55:36,287 INFO L525 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-01-24 11:55:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 11:55:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 11:55:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 11:55:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-24 11:55:36,297 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-24 11:55:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:36,298 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-24 11:55:36,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:55:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-24 11:55:36,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 11:55:36,299 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:36,299 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:36,299 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-01-24 11:55:36,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-24 11:55:36,299 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:36,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:36,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:36,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:36,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:36,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:36,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:36,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:55:36,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:55:36,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:55:36,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:55:36,402 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-24 11:55:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:36,483 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-24 11:55:36,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:55:36,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 11:55:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:36,485 INFO L225 Difference]: With dead ends: 145 [2018-01-24 11:55:36,486 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 11:55:36,486 INFO L525 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-01-24 11:55:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 11:55:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-24 11:55:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 11:55:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-24 11:55:36,501 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-24 11:55:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:36,502 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-24 11:55:36,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:55:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-24 11:55:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:55:36,502 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:36,502 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:36,502 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-01-24 11:55:36,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-24 11:55:36,503 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:36,503 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:36,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:36,504 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:36,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:36,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:36,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:36,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:55:36,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:55:36,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:55:36,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:55:36,557 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-24 11:55:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:36,619 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-24 11:55:36,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:55:36,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 11:55:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:36,621 INFO L225 Difference]: With dead ends: 148 [2018-01-24 11:55:36,621 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 11:55:36,622 INFO L525 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-01-24 11:55:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 11:55:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-24 11:55:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 11:55:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-24 11:55:36,634 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-24 11:55:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:36,634 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-24 11:55:36,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:55:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-24 11:55:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:55:36,635 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:36,635 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:36,635 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-01-24 11:55:36,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-24 11:55:36,635 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:36,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:36,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:36,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:36,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:36,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:36,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:36,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:55:36,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:55:36,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:55:36,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:55:36,707 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-24 11:55:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:36,848 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-24 11:55:36,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:55:36,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 11:55:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:36,851 INFO L225 Difference]: With dead ends: 385 [2018-01-24 11:55:36,851 INFO L226 Difference]: Without dead ends: 255 [2018-01-24 11:55:36,853 INFO L525 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-01-24 11:55:36,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-24 11:55:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-24 11:55:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 11:55:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-24 11:55:36,877 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-24 11:55:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:36,877 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-24 11:55:36,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:55:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-24 11:55:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:55:36,878 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:36,878 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:36,878 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-01-24 11:55:36,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-24 11:55:36,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:36,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:36,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:36,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:36,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:36,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:36,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:36,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:55:36,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:55:36,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:55:36,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:55:36,925 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-24 11:55:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:37,083 INFO L93 Difference]: Finished difference Result 390 states and 581 transitions. [2018-01-24 11:55:37,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:55:37,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 11:55:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:37,088 INFO L225 Difference]: With dead ends: 390 [2018-01-24 11:55:37,088 INFO L226 Difference]: Without dead ends: 386 [2018-01-24 11:55:37,088 INFO L525 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-01-24 11:55:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-24 11:55:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-01-24 11:55:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-24 11:55:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-24 11:55:37,121 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-24 11:55:37,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:37,121 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-24 11:55:37,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:55:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-24 11:55:37,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:55:37,122 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:37,122 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:37,122 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-01-24 11:55:37,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-24 11:55:37,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:37,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:37,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:37,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:37,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:37,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:37,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:37,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:55:37,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:55:37,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:55:37,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:55:37,213 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-24 11:55:37,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:37,386 INFO L93 Difference]: Finished difference Result 489 states and 728 transitions. [2018-01-24 11:55:37,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:55:37,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 11:55:37,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:37,396 INFO L225 Difference]: With dead ends: 489 [2018-01-24 11:55:37,396 INFO L226 Difference]: Without dead ends: 485 [2018-01-24 11:55:37,397 INFO L525 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-01-24 11:55:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-01-24 11:55:37,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-01-24 11:55:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-24 11:55:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-24 11:55:37,431 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-24 11:55:37,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:37,432 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-24 11:55:37,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:55:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-24 11:55:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:55:37,433 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:37,433 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:37,434 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-01-24 11:55:37,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-24 11:55:37,434 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:37,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:37,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:37,435 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:37,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:37,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:37,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:37,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:55:37,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:55:37,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:55:37,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:55:37,506 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-24 11:55:37,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:37,593 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-24 11:55:37,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:55:37,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 11:55:37,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:37,600 INFO L225 Difference]: With dead ends: 1316 [2018-01-24 11:55:37,601 INFO L226 Difference]: Without dead ends: 861 [2018-01-24 11:55:37,603 INFO L525 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-01-24 11:55:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-24 11:55:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-24 11:55:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-24 11:55:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-24 11:55:37,662 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-24 11:55:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:37,662 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-24 11:55:37,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:55:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-24 11:55:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 11:55:37,664 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:37,664 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:37,664 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-01-24 11:55:37,664 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-24 11:55:37,664 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:37,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:37,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:37,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:37,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:37,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:37,762 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:37,762 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:55:37,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:37,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:37,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:37,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-01-24 11:55:37,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:55:37,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:55:37,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:55:37,955 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 9 states. [2018-01-24 11:55:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:38,794 INFO L93 Difference]: Finished difference Result 2243 states and 3305 transitions. [2018-01-24 11:55:38,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 11:55:38,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 11:55:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:38,804 INFO L225 Difference]: With dead ends: 2243 [2018-01-24 11:55:38,804 INFO L226 Difference]: Without dead ends: 1420 [2018-01-24 11:55:38,808 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-24 11:55:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-01-24 11:55:38,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1268. [2018-01-24 11:55:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-01-24 11:55:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1792 transitions. [2018-01-24 11:55:38,917 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1792 transitions. Word has length 26 [2018-01-24 11:55:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:38,918 INFO L432 AbstractCegarLoop]: Abstraction has 1268 states and 1792 transitions. [2018-01-24 11:55:38,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:55:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1792 transitions. [2018-01-24 11:55:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 11:55:38,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:38,920 INFO L322 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-01-24 11:55:38,920 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-01-24 11:55:38,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-01-24 11:55:38,920 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:38,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:38,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:38,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:38,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:38,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:39,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:39,331 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:55:39,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:39,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:39,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:55:39,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2018-01-24 11:55:39,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:55:39,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:55:39,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:55:39,615 INFO L87 Difference]: Start difference. First operand 1268 states and 1792 transitions. Second operand 12 states. [2018-01-24 11:55:40,497 WARN L143 SmtUtils]: Spent 126ms on a formula simplification that was a NOOP. DAG size: 14 [2018-01-24 11:55:42,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:42,760 INFO L93 Difference]: Finished difference Result 6681 states and 9903 transitions. [2018-01-24 11:55:42,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-24 11:55:42,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-01-24 11:55:42,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:42,796 INFO L225 Difference]: With dead ends: 6681 [2018-01-24 11:55:42,796 INFO L226 Difference]: Without dead ends: 5418 [2018-01-24 11:55:42,803 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 11:55:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5418 states. [2018-01-24 11:55:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5418 to 5126. [2018-01-24 11:55:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5126 states. [2018-01-24 11:55:43,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5126 states to 5126 states and 7531 transitions. [2018-01-24 11:55:43,120 INFO L78 Accepts]: Start accepts. Automaton has 5126 states and 7531 transitions. Word has length 27 [2018-01-24 11:55:43,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:43,120 INFO L432 AbstractCegarLoop]: Abstraction has 5126 states and 7531 transitions. [2018-01-24 11:55:43,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:55:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 5126 states and 7531 transitions. [2018-01-24 11:55:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 11:55:43,125 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:43,125 INFO L322 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-01-24 11:55:43,125 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-01-24 11:55:43,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-01-24 11:55:43,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:43,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:43,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:43,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:43,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:43,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:43,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:55:43,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:55:43,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:55:43,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:55:43,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:55:43,252 INFO L87 Difference]: Start difference. First operand 5126 states and 7531 transitions. Second operand 7 states. [2018-01-24 11:55:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:43,521 INFO L93 Difference]: Finished difference Result 7311 states and 10404 transitions. [2018-01-24 11:55:43,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:55:43,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 11:55:43,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:43,529 INFO L225 Difference]: With dead ends: 7311 [2018-01-24 11:55:43,529 INFO L226 Difference]: Without dead ends: 1842 [2018-01-24 11:55:43,538 INFO L525 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-01-24 11:55:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2018-01-24 11:55:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1685. [2018-01-24 11:55:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2018-01-24 11:55:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2271 transitions. [2018-01-24 11:55:43,607 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2271 transitions. Word has length 31 [2018-01-24 11:55:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:43,607 INFO L432 AbstractCegarLoop]: Abstraction has 1685 states and 2271 transitions. [2018-01-24 11:55:43,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:55:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2271 transitions. [2018-01-24 11:55:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 11:55:43,609 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:43,609 INFO L322 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-01-24 11:55:43,609 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-01-24 11:55:43,610 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-01-24 11:55:43,610 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:43,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:43,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:43,611 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:43,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:43,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:43,757 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:43,757 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:55:43,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:43,831 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-24 11:55:44,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:55:44,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-01-24 11:55:44,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 11:55:44,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 11:55:44,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:55:44,010 INFO L87 Difference]: Start difference. First operand 1685 states and 2271 transitions. Second operand 10 states. [2018-01-24 11:55:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:44,724 INFO L93 Difference]: Finished difference Result 3458 states and 4747 transitions. [2018-01-24 11:55:44,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 11:55:44,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-01-24 11:55:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:44,730 INFO L225 Difference]: With dead ends: 3458 [2018-01-24 11:55:44,730 INFO L226 Difference]: Without dead ends: 1778 [2018-01-24 11:55:44,734 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:55:44,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2018-01-24 11:55:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1546. [2018-01-24 11:55:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-01-24 11:55:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2062 transitions. [2018-01-24 11:55:44,796 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2062 transitions. Word has length 38 [2018-01-24 11:55:44,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:44,796 INFO L432 AbstractCegarLoop]: Abstraction has 1546 states and 2062 transitions. [2018-01-24 11:55:44,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 11:55:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2062 transitions. [2018-01-24 11:55:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 11:55:44,798 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:44,798 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:55:44,798 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-01-24 11:55:44,798 INFO L82 PathProgramCache]: Analyzing trace with hash -510703423, now seen corresponding path program 1 times [2018-01-24 11:55:44,798 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:44,799 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:44,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:44,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:44,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:44,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 11:55:44,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:44,968 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:55:44,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:45,023 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 11:55:45,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:45,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-01-24 11:55:45,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 11:55:45,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 11:55:45,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:55:45,137 INFO L87 Difference]: Start difference. First operand 1546 states and 2062 transitions. Second operand 15 states. [2018-01-24 11:55:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:45,815 INFO L93 Difference]: Finished difference Result 2770 states and 3641 transitions. [2018-01-24 11:55:45,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-24 11:55:45,816 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-01-24 11:55:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:45,820 INFO L225 Difference]: With dead ends: 2770 [2018-01-24 11:55:45,820 INFO L226 Difference]: Without dead ends: 1175 [2018-01-24 11:55:45,823 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1121, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 11:55:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-01-24 11:55:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1053. [2018-01-24 11:55:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-01-24 11:55:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1330 transitions. [2018-01-24 11:55:45,863 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1330 transitions. Word has length 41 [2018-01-24 11:55:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:45,864 INFO L432 AbstractCegarLoop]: Abstraction has 1053 states and 1330 transitions. [2018-01-24 11:55:45,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 11:55:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1330 transitions. [2018-01-24 11:55:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 11:55:45,864 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:45,864 INFO L322 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-01-24 11:55:45,864 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-01-24 11:55:45,865 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-01-24 11:55:45,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:45,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:45,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:45,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:45,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:45,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 11:55:45,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:45,952 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:55:45,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:45,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:55:46,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:46,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-01-24 11:55:46,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:55:46,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:55:46,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:55:46,051 INFO L87 Difference]: Start difference. First operand 1053 states and 1330 transitions. Second operand 12 states. [2018-01-24 11:55:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:46,414 INFO L93 Difference]: Finished difference Result 2489 states and 3187 transitions. [2018-01-24 11:55:46,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 11:55:46,415 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-01-24 11:55:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:46,422 INFO L225 Difference]: With dead ends: 2489 [2018-01-24 11:55:46,422 INFO L226 Difference]: Without dead ends: 1468 [2018-01-24 11:55:46,425 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:55:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-01-24 11:55:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1360. [2018-01-24 11:55:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-01-24 11:55:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1732 transitions. [2018-01-24 11:55:46,510 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1732 transitions. Word has length 42 [2018-01-24 11:55:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:46,511 INFO L432 AbstractCegarLoop]: Abstraction has 1360 states and 1732 transitions. [2018-01-24 11:55:46,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:55:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1732 transitions. [2018-01-24 11:55:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 11:55:46,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:46,512 INFO L322 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-01-24 11:55:46,512 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-01-24 11:55:46,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-01-24 11:55:46,513 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:46,513 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:46,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:46,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:46,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:46,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 11:55:46,659 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:46,659 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:55:46,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:46,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 11:55:46,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:46,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-24 11:55:46,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:55:46,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:55:46,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:55:46,814 INFO L87 Difference]: Start difference. First operand 1360 states and 1732 transitions. Second operand 11 states. [2018-01-24 11:55:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:47,320 INFO L93 Difference]: Finished difference Result 3115 states and 4059 transitions. [2018-01-24 11:55:47,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:55:47,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-01-24 11:55:47,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:47,329 INFO L225 Difference]: With dead ends: 3115 [2018-01-24 11:55:47,329 INFO L226 Difference]: Without dead ends: 1787 [2018-01-24 11:55:47,333 INFO L525 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-01-24 11:55:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-01-24 11:55:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1392. [2018-01-24 11:55:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2018-01-24 11:55:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1780 transitions. [2018-01-24 11:55:47,430 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1780 transitions. Word has length 54 [2018-01-24 11:55:47,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:47,431 INFO L432 AbstractCegarLoop]: Abstraction has 1392 states and 1780 transitions. [2018-01-24 11:55:47,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:55:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1780 transitions. [2018-01-24 11:55:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 11:55:47,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:47,433 INFO L322 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-01-24 11:55:47,433 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-01-24 11:55:47,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-01-24 11:55:47,433 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:47,433 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:47,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:47,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:47,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:47,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 11:55:47,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:47,640 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:55:47,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:47,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 11:55:47,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:47,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-01-24 11:55:47,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 11:55:47,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 11:55:47,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:55:47,770 INFO L87 Difference]: Start difference. First operand 1392 states and 1780 transitions. Second operand 15 states. [2018-01-24 11:55:48,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:48,209 INFO L93 Difference]: Finished difference Result 3688 states and 4895 transitions. [2018-01-24 11:55:48,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 11:55:48,209 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-01-24 11:55:48,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:48,217 INFO L225 Difference]: With dead ends: 3688 [2018-01-24 11:55:48,217 INFO L226 Difference]: Without dead ends: 2292 [2018-01-24 11:55:48,220 INFO L525 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-01-24 11:55:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2018-01-24 11:55:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 1891. [2018-01-24 11:55:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2018-01-24 11:55:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2436 transitions. [2018-01-24 11:55:48,351 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2436 transitions. Word has length 54 [2018-01-24 11:55:48,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:48,352 INFO L432 AbstractCegarLoop]: Abstraction has 1891 states and 2436 transitions. [2018-01-24 11:55:48,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 11:55:48,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2436 transitions. [2018-01-24 11:55:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-24 11:55:48,353 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:48,354 INFO L322 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-01-24 11:55:48,354 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-01-24 11:55:48,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-01-24 11:55:48,354 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:48,354 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:48,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:48,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:48,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:48,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-24 11:55:48,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:48,500 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:55:48,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:48,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-24 11:55:48,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:48,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-24 11:55:48,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:55:48,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:55:48,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:55:48,735 INFO L87 Difference]: Start difference. First operand 1891 states and 2436 transitions. Second operand 11 states. [2018-01-24 11:55:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:49,177 INFO L93 Difference]: Finished difference Result 4145 states and 5419 transitions. [2018-01-24 11:55:49,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:55:49,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-01-24 11:55:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:49,185 INFO L225 Difference]: With dead ends: 4145 [2018-01-24 11:55:49,186 INFO L226 Difference]: Without dead ends: 2286 [2018-01-24 11:55:49,189 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:55:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2018-01-24 11:55:49,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2262. [2018-01-24 11:55:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-01-24 11:55:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2964 transitions. [2018-01-24 11:55:49,340 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2964 transitions. Word has length 68 [2018-01-24 11:55:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:49,340 INFO L432 AbstractCegarLoop]: Abstraction has 2262 states and 2964 transitions. [2018-01-24 11:55:49,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:55:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2964 transitions. [2018-01-24 11:55:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-24 11:55:49,342 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:49,342 INFO L322 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-01-24 11:55:49,343 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-01-24 11:55:49,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-01-24 11:55:49,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:49,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:49,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:49,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:49,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:49,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:49,553 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 14 DAG size of output 13 [2018-01-24 11:55:49,697 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 22 DAG size of output 18 [2018-01-24 11:55:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 11:55:49,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:49,736 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:55:49,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:49,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 11:55:49,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:49,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-01-24 11:55:49,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 11:55:49,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 11:55:49,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-01-24 11:55:49,945 INFO L87 Difference]: Start difference. First operand 2262 states and 2964 transitions. Second operand 18 states. [2018-01-24 11:55:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:51,184 INFO L93 Difference]: Finished difference Result 6186 states and 8339 transitions. [2018-01-24 11:55:51,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 11:55:51,184 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-01-24 11:55:51,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:51,197 INFO L225 Difference]: With dead ends: 6186 [2018-01-24 11:55:51,197 INFO L226 Difference]: Without dead ends: 3908 [2018-01-24 11:55:51,202 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 11:55:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2018-01-24 11:55:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 2887. [2018-01-24 11:55:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2887 states. [2018-01-24 11:55:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 3730 transitions. [2018-01-24 11:55:51,385 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 3730 transitions. Word has length 70 [2018-01-24 11:55:51,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:51,385 INFO L432 AbstractCegarLoop]: Abstraction has 2887 states and 3730 transitions. [2018-01-24 11:55:51,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 11:55:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 3730 transitions. [2018-01-24 11:55:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-24 11:55:51,388 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:51,388 INFO L322 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-01-24 11:55:51,388 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-01-24 11:55:51,388 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-01-24 11:55:51,389 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:51,389 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:51,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:51,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:51,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:51,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-24 11:55:51,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:51,640 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:55:51,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:51,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-24 11:55:51,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:51,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-01-24 11:55:51,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:55:51,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:55:51,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:55:51,816 INFO L87 Difference]: Start difference. First operand 2887 states and 3730 transitions. Second operand 17 states. [2018-01-24 11:55:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:52,674 INFO L93 Difference]: Finished difference Result 6729 states and 8895 transitions. [2018-01-24 11:55:52,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 11:55:52,674 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-01-24 11:55:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:52,684 INFO L225 Difference]: With dead ends: 6729 [2018-01-24 11:55:52,685 INFO L226 Difference]: Without dead ends: 3806 [2018-01-24 11:55:52,690 INFO L525 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-01-24 11:55:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3806 states. [2018-01-24 11:55:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 2819. [2018-01-24 11:55:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2819 states. [2018-01-24 11:55:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3608 transitions. [2018-01-24 11:55:52,842 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3608 transitions. Word has length 84 [2018-01-24 11:55:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:52,842 INFO L432 AbstractCegarLoop]: Abstraction has 2819 states and 3608 transitions. [2018-01-24 11:55:52,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:55:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3608 transitions. [2018-01-24 11:55:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-24 11:55:52,843 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:52,843 INFO L322 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-01-24 11:55:52,844 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-01-24 11:55:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-01-24 11:55:52,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:52,844 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:52,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:52,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:52,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:52,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 40 proven. 64 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-24 11:55:53,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:53,069 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:55:53,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:53,138 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 101 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 11:55:53,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:53,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-01-24 11:55:53,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:55:53,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:55:53,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:55:53,251 INFO L87 Difference]: Start difference. First operand 2819 states and 3608 transitions. Second operand 17 states. [2018-01-24 11:55:53,968 WARN L143 SmtUtils]: Spent 169ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-24 11:55:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:55:56,125 INFO L93 Difference]: Finished difference Result 9479 states and 12221 transitions. [2018-01-24 11:55:56,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-01-24 11:55:56,126 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-01-24 11:55:56,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:55:56,144 INFO L225 Difference]: With dead ends: 9479 [2018-01-24 11:55:56,144 INFO L226 Difference]: Without dead ends: 6699 [2018-01-24 11:55:56,154 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1093, Invalid=5387, Unknown=0, NotChecked=0, Total=6480 [2018-01-24 11:55:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6699 states. [2018-01-24 11:55:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6699 to 5964. [2018-01-24 11:55:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5964 states. [2018-01-24 11:55:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5964 states to 5964 states and 7670 transitions. [2018-01-24 11:55:56,518 INFO L78 Accepts]: Start accepts. Automaton has 5964 states and 7670 transitions. Word has length 87 [2018-01-24 11:55:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:55:56,519 INFO L432 AbstractCegarLoop]: Abstraction has 5964 states and 7670 transitions. [2018-01-24 11:55:56,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:55:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 5964 states and 7670 transitions. [2018-01-24 11:55:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-24 11:55:56,520 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:55:56,521 INFO L322 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-01-24 11:55:56,521 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-01-24 11:55:56,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1189470598, now seen corresponding path program 1 times [2018-01-24 11:55:56,521 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:55:56,521 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:55:56,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:56,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:56,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:55:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:56,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:55:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-24 11:55:56,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:55:56,855 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:55:56,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:55:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:55:56,959 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:55:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 81 proven. 41 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-24 11:55:57,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:55:57,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-01-24 11:55:57,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 11:55:57,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 11:55:57,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-01-24 11:55:57,251 INFO L87 Difference]: Start difference. First operand 5964 states and 7670 transitions. Second operand 20 states. [2018-01-24 11:55:59,796 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 27 DAG size of output 26 [2018-01-24 11:56:05,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:05,031 INFO L93 Difference]: Finished difference Result 23590 states and 30951 transitions. [2018-01-24 11:56:05,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-01-24 11:56:05,031 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-01-24 11:56:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:05,074 INFO L225 Difference]: With dead ends: 23590 [2018-01-24 11:56:05,074 INFO L226 Difference]: Without dead ends: 17586 [2018-01-24 11:56:05,093 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15935 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4644, Invalid=34362, Unknown=0, NotChecked=0, Total=39006 [2018-01-24 11:56:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17586 states. [2018-01-24 11:56:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17586 to 14223. [2018-01-24 11:56:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14223 states. [2018-01-24 11:56:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14223 states to 14223 states and 18426 transitions. [2018-01-24 11:56:05,969 INFO L78 Accepts]: Start accepts. Automaton has 14223 states and 18426 transitions. Word has length 99 [2018-01-24 11:56:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:05,970 INFO L432 AbstractCegarLoop]: Abstraction has 14223 states and 18426 transitions. [2018-01-24 11:56:05,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 11:56:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 14223 states and 18426 transitions. [2018-01-24 11:56:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-24 11:56:05,972 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:05,972 INFO L322 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-01-24 11:56:05,972 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-01-24 11:56:05,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1793769950, now seen corresponding path program 1 times [2018-01-24 11:56:05,972 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:05,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:05,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:05,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:05,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:05,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-24 11:56:06,197 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:56:06,197 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:56:06,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:06,354 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:56:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 53 proven. 89 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-24 11:56:06,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:56:06,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-01-24 11:56:06,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 11:56:06,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 11:56:06,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-01-24 11:56:06,697 INFO L87 Difference]: Start difference. First operand 14223 states and 18426 transitions. Second operand 20 states. [2018-01-24 11:56:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:10,407 INFO L93 Difference]: Finished difference Result 21032 states and 27332 transitions. [2018-01-24 11:56:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-24 11:56:10,408 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 105 [2018-01-24 11:56:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:10,449 INFO L225 Difference]: With dead ends: 21032 [2018-01-24 11:56:10,450 INFO L226 Difference]: Without dead ends: 21029 [2018-01-24 11:56:10,459 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 109 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=450, Invalid=2000, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 11:56:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21029 states. [2018-01-24 11:56:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21029 to 20343. [2018-01-24 11:56:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20343 states. [2018-01-24 11:56:11,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20343 states to 20343 states and 26286 transitions. [2018-01-24 11:56:11,696 INFO L78 Accepts]: Start accepts. Automaton has 20343 states and 26286 transitions. Word has length 105 [2018-01-24 11:56:11,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:11,696 INFO L432 AbstractCegarLoop]: Abstraction has 20343 states and 26286 transitions. [2018-01-24 11:56:11,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 11:56:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 20343 states and 26286 transitions. [2018-01-24 11:56:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-01-24 11:56:11,705 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:11,705 INFO L322 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-01-24 11:56:11,705 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-01-24 11:56:11,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1854918738, now seen corresponding path program 1 times [2018-01-24 11:56:11,706 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:11,706 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:11,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:11,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:11,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:11,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:56:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 86 proven. 4 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-01-24 11:56:11,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:56:11,946 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 11:56:11,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:56:12,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:56:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 86 proven. 4 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-01-24 11:56:12,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:56:12,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-24 11:56:12,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:56:12,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:56:12,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:56:12,144 INFO L87 Difference]: Start difference. First operand 20343 states and 26286 transitions. Second operand 11 states. [2018-01-24 11:56:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:56:13,609 INFO L93 Difference]: Finished difference Result 41683 states and 54007 transitions. [2018-01-24 11:56:13,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 11:56:13,609 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 131 [2018-01-24 11:56:13,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:56:13,648 INFO L225 Difference]: With dead ends: 41683 [2018-01-24 11:56:13,648 INFO L226 Difference]: Without dead ends: 21223 [2018-01-24 11:56:13,672 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-01-24 11:56:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21223 states. [2018-01-24 11:56:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21223 to 20285. [2018-01-24 11:56:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20285 states. [2018-01-24 11:56:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20285 states to 20285 states and 25913 transitions. [2018-01-24 11:56:14,955 INFO L78 Accepts]: Start accepts. Automaton has 20285 states and 25913 transitions. Word has length 131 [2018-01-24 11:56:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:56:14,956 INFO L432 AbstractCegarLoop]: Abstraction has 20285 states and 25913 transitions. [2018-01-24 11:56:14,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:56:14,956 INFO L276 IsEmpty]: Start isEmpty. Operand 20285 states and 25913 transitions. [2018-01-24 11:56:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-01-24 11:56:14,962 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:56:14,962 INFO L322 BasicCegarLoop]: trace histogram [11, 11, 10, 9, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:56:14,962 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-01-24 11:56:14,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1800322707, now seen corresponding path program 1 times [2018-01-24 11:56:14,963 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:56:14,963 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:56:14,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:14,964 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:56:14,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:56:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 11:56:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 11:56:15,107 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 11:56:15,213 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 11:56:15,225 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,226 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,227 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,228 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,229 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,232 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,233 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,235 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,239 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,240 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,242 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,243 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,245 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,247 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,249 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,250 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,252 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,253 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,255 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,255 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-24 11:56:15,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:56:15 BoogieIcfgContainer [2018-01-24 11:56:15,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:56:15,295 INFO L168 Benchmark]: Toolchain (without parser) took 40272.22 ms. Allocated memory was 303.0 MB in the beginning and 1.2 GB in the end (delta: 891.3 MB). Free memory was 263.1 MB in the beginning and 797.6 MB in the end (delta: -534.5 MB). Peak memory consumption was 356.8 MB. Max. memory is 5.3 GB. [2018-01-24 11:56:15,297 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:56:15,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.76 ms. Allocated memory is still 303.0 MB. Free memory was 262.0 MB in the beginning and 251.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:56:15,297 INFO L168 Benchmark]: Boogie Preprocessor took 48.66 ms. Allocated memory is still 303.0 MB. Free memory was 251.1 MB in the beginning and 249.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:56:15,297 INFO L168 Benchmark]: RCFGBuilder took 435.94 ms. Allocated memory is still 303.0 MB. Free memory was 249.1 MB in the beginning and 223.5 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-24 11:56:15,298 INFO L168 Benchmark]: TraceAbstraction took 39564.92 ms. Allocated memory was 303.0 MB in the beginning and 1.2 GB in the end (delta: 891.3 MB). Free memory was 223.5 MB in the beginning and 797.6 MB in the end (delta: -574.1 MB). Peak memory consumption was 317.2 MB. Max. memory is 5.3 GB. [2018-01-24 11:56:15,299 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.20 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.76 ms. Allocated memory is still 303.0 MB. Free memory was 262.0 MB in the beginning and 251.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.66 ms. Allocated memory is still 303.0 MB. Free memory was 251.1 MB in the beginning and 249.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 435.94 ms. Allocated memory is still 303.0 MB. Free memory was 249.1 MB in the beginning and 223.5 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 39564.92 ms. Allocated memory was 303.0 MB in the beginning and 1.2 GB in the end (delta: 891.3 MB). Free memory was 223.5 MB in the beginning and 797.6 MB in the end (delta: -574.1 MB). Peak memory consumption was 317.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 688]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 688. Possible FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] EXPR, FCALL malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L634] FCALL x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L635] RET, FCALL x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L638] RET, FCALL x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L641] RET t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L644] RET, FCALL x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L647] COND TRUE S == t1 [L648] RET S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: [L652] case 6: [L653] RET pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L665] RET t4 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L668] COND FALSE, RET !(t4 == ((void *)0)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L672] EXPR, FCALL t4->next VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, t4->next={0:0}, x1={12:0}, x4={0:0}] [L672] RET x4 = t4->next [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: [L674] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L675] COND TRUE S == t4 [L676] RET S = x4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. UNSAFE Result, 39.5s OverallTime, 24 OverallIterations, 11 TraceHistogramMax, 26.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2553 SDtfs, 8542 SDslu, 6441 SDs, 0 SdLazy, 15172 SolverSat, 2458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1708 GetRequests, 1059 SyntacticMatches, 18 SemanticMatches, 631 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20275 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20343occurred in iteration=22, 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, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 9754 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2137 NumberOfCodeBlocks, 2137 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1955 ConstructedInterpolants, 10 QuantifiedInterpolants, 486860 SizeOfPredicates, 65 NumberOfNonLiveVariables, 6933 ConjunctsInSsa, 241 ConjunctsInUnsatCore, 37 InterpolantComputations, 11 PerfectInterpolantSequences, 2100/2639 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-56-15-308.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-56-15-308.csv Received shutdown request...