java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:03:22,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:03:22,070 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:03:22,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:03:22,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:03:22,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:03:22,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:03:22,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:03:22,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:03:22,084 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:03:22,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:03:22,085 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:03:22,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:03:22,086 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:03:22,087 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:03:22,089 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:03:22,090 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:03:22,092 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:03:22,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:03:22,094 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:03:22,096 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:03:22,096 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:03:22,096 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:03:22,097 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:03:22,098 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:03:22,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:03:22,099 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:03:22,099 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:03:22,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:03:22,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:03:22,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:03:22,100 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 02:03:22,110 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:03:22,110 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:03:22,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:03:22,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:03:22,111 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:03:22,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:03:22,112 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:03:22,112 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:03:22,112 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:03:22,112 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:03:22,112 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:03:22,113 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:03:22,113 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:03:22,113 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:03:22,113 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:03:22,113 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:03:22,113 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:03:22,113 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:03:22,114 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:03:22,114 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:03:22,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:03:22,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:03:22,114 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:03:22,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:03:22,155 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:03:22,158 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:03:22,161 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:03:22,162 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:03:22,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-02-04 02:03:22,299 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:03:22,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:03:22,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:03:22,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:03:22,305 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:03:22,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:03:22" (1/1) ... [2018-02-04 02:03:22,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece180a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:22, skipping insertion in model container [2018-02-04 02:03:22,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:03:22" (1/1) ... [2018-02-04 02:03:22,321 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:03:22,350 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:03:22,442 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:03:22,455 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:03:22,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:22 WrapperNode [2018-02-04 02:03:22,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:03:22,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:03:22,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:03:22,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:03:22,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:22" (1/1) ... [2018-02-04 02:03:22,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:22" (1/1) ... [2018-02-04 02:03:22,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:22" (1/1) ... [2018-02-04 02:03:22,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:22" (1/1) ... [2018-02-04 02:03:22,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:22" (1/1) ... [2018-02-04 02:03:22,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:22" (1/1) ... [2018-02-04 02:03:22,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:22" (1/1) ... [2018-02-04 02:03:22,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:03:22,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:03:22,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:03:22,485 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:03:22,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:22" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:03:22,520 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:03:22,520 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:03:22,520 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-04 02:03:22,520 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-04 02:03:22,521 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:03:22,521 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 02:03:22,521 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 02:03:22,521 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 02:03:22,521 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 02:03:22,521 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:03:22,521 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:03:22,521 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:03:22,521 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 02:03:22,521 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 02:03:22,521 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 02:03:22,521 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-04 02:03:22,522 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-04 02:03:22,522 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:03:22,522 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:03:22,522 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:03:22,741 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:03:22,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:03:22 BoogieIcfgContainer [2018-02-04 02:03:22,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:03:22,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:03:22,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:03:22,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:03:22,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:03:22" (1/3) ... [2018-02-04 02:03:22,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4b0ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:03:22, skipping insertion in model container [2018-02-04 02:03:22,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:22" (2/3) ... [2018-02-04 02:03:22,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4b0ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:03:22, skipping insertion in model container [2018-02-04 02:03:22,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:03:22" (3/3) ... [2018-02-04 02:03:22,745 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-02-04 02:03:22,751 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:03:22,756 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 02:03:22,786 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:03:22,786 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:03:22,786 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:03:22,786 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:03:22,787 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:03:22,787 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:03:22,787 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:03:22,787 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:03:22,788 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:03:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 02:03:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 02:03:22,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:22,808 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:22,808 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:22,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-04 02:03:22,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:22,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:22,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:22,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:03:22,945 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:22,946 INFO L182 omatonBuilderFactory]: Interpolants [80#false, 79#true] [2018-02-04 02:03:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:22,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 02:03:22,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 02:03:22,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 02:03:22,961 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-04 02:03:23,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:23,034 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-04 02:03:23,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 02:03:23,036 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 02:03:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:23,049 INFO L225 Difference]: With dead ends: 76 [2018-02-04 02:03:23,049 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 02:03:23,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 02:03:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 02:03:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 02:03:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 02:03:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-04 02:03:23,079 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-04 02:03:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:23,079 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-04 02:03:23,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 02:03:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-04 02:03:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 02:03:23,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:23,080 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:23,080 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-04 02:03:23,081 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:23,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:23,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:03:23,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,119 INFO L182 omatonBuilderFactory]: Interpolants [230#true, 231#false, 232#|main_#t~short13|] [2018-02-04 02:03:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:03:23,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:03:23,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:23,122 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-04 02:03:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:23,137 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-04 02:03:23,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:03:23,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 02:03:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:23,138 INFO L225 Difference]: With dead ends: 74 [2018-02-04 02:03:23,138 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 02:03:23,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 02:03:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 02:03:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 02:03:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 02:03:23,145 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-04 02:03:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:23,146 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 02:03:23,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:03:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 02:03:23,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 02:03:23,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:23,146 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:23,147 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:23,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-04 02:03:23,147 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:23,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:23,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:03:23,218 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,218 INFO L182 omatonBuilderFactory]: Interpolants [381#true, 382#false, 383#(and (= 0 ~garbage.base) (= 0 ~garbage.offset))] [2018-02-04 02:03:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:03:23,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:03:23,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:23,219 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-04 02:03:23,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:23,237 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-04 02:03:23,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:03:23,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 02:03:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:23,238 INFO L225 Difference]: With dead ends: 132 [2018-02-04 02:03:23,238 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 02:03:23,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 02:03:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-04 02:03:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 02:03:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-04 02:03:23,248 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-04 02:03:23,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:23,248 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-04 02:03:23,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:03:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-04 02:03:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 02:03:23,249 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:23,249 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:23,249 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:23,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-04 02:03:23,250 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:23,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:23,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:03:23,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,301 INFO L182 omatonBuilderFactory]: Interpolants [630#true, 631#false, 632#(= |#valid| |old(#valid)|)] [2018-02-04 02:03:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:03:23,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:03:23,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:23,302 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-04 02:03:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:23,350 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-04 02:03:23,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:03:23,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 02:03:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:23,351 INFO L225 Difference]: With dead ends: 147 [2018-02-04 02:03:23,352 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 02:03:23,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 02:03:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-04 02:03:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 02:03:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-04 02:03:23,363 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-04 02:03:23,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:23,363 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-04 02:03:23,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:03:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-04 02:03:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 02:03:23,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:23,363 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:23,363 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:23,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-04 02:03:23,364 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:23,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:23,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:03:23,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:23,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-02-04 02:03:23,401 INFO L182 omatonBuilderFactory]: Interpolants [915#true, 916#false, 917#(<= ~pc1 1), 918#(<= |push_#t~post0| 1), 919#(not |push_#t~switch1|)] [2018-02-04 02:03:23,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-02-04 02:03:23,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:03:23,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:03:23,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:03:23,401 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-04 02:03:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:23,480 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-04 02:03:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:03:23,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 02:03:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:23,482 INFO L225 Difference]: With dead ends: 255 [2018-02-04 02:03:23,482 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 02:03:23,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:03:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 02:03:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-04 02:03:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 02:03:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-04 02:03:23,495 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-04 02:03:23,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:23,495 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-04 02:03:23,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:03:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-04 02:03:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:03:23,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:23,496 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:23,496 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:23,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-04 02:03:23,497 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:23,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:23,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:03:23,534 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,534 INFO L182 omatonBuilderFactory]: Interpolants [1403#true, 1404#false, 1405#(= 1 (select |#valid| |push_#t~malloc2.base|)), 1406#(= 1 (select |#valid| ~x1.base))] [2018-02-04 02:03:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:03:23,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:03:23,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:03:23,535 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-04 02:03:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:23,611 INFO L93 Difference]: Finished difference Result 386 states and 569 transitions. [2018-02-04 02:03:23,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:03:23,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 02:03:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:23,614 INFO L225 Difference]: With dead ends: 386 [2018-02-04 02:03:23,615 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 02:03:23,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:03:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 02:03:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-02-04 02:03:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 02:03:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-04 02:03:23,631 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-04 02:03:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:23,632 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-04 02:03:23,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:03:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-04 02:03:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:03:23,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:23,633 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:23,633 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-04 02:03:23,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:23,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:23,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:03:23,687 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,687 INFO L182 omatonBuilderFactory]: Interpolants [2153#true, 2154#false, 2155#(and (= 8 (select |#length| |push_#t~malloc2.base|)) (= 0 |push_#t~malloc2.offset|)), 2156#(and (= (select |#length| ~x1.base) 8) (= ~x1.offset 0))] [2018-02-04 02:03:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:03:23,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:03:23,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:03:23,688 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-04 02:03:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:23,779 INFO L93 Difference]: Finished difference Result 485 states and 716 transitions. [2018-02-04 02:03:23,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:03:23,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 02:03:23,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:23,783 INFO L225 Difference]: With dead ends: 485 [2018-02-04 02:03:23,783 INFO L226 Difference]: Without dead ends: 485 [2018-02-04 02:03:23,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:03:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-04 02:03:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-02-04 02:03:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-04 02:03:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-04 02:03:23,798 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-04 02:03:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:23,799 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-04 02:03:23,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:03:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-04 02:03:23,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:03:23,799 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:23,799 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:23,800 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:23,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-04 02:03:23,801 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:23,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:23,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:03:23,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,846 INFO L182 omatonBuilderFactory]: Interpolants [3104#true, 3105#false, 3106#(<= ~pc4 1), 3107#(<= |pop_#t~post7| 1), 3108#(not |pop_#t~switch8|)] [2018-02-04 02:03:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:03:23,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:03:23,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:03:23,847 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-04 02:03:23,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:23,895 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-04 02:03:23,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:03:23,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 02:03:23,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:23,899 INFO L225 Difference]: With dead ends: 861 [2018-02-04 02:03:23,899 INFO L226 Difference]: Without dead ends: 861 [2018-02-04 02:03:23,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:03:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-04 02:03:23,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-04 02:03:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-04 02:03:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-04 02:03:23,919 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-04 02:03:23,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:23,920 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-04 02:03:23,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:03:23,920 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-04 02:03:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 02:03:23,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:23,921 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:23,921 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:23,921 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-04 02:03:23,922 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:23,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:23,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:03:23,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,975 INFO L182 omatonBuilderFactory]: Interpolants [4800#true, 4801#false, 4802#(or (not |pop_#t~switch8|) (<= ~pc4 2)), 4803#(<= ~pc4 2), 4804#(<= |pop_#t~post7| 2), 4805#(not |pop_#t~switch8|)] [2018-02-04 02:03:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:23,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:03:23,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:03:23,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:03:23,975 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-02-04 02:03:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:24,062 INFO L93 Difference]: Finished difference Result 1289 states and 1809 transitions. [2018-02-04 02:03:24,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:03:24,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 02:03:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:24,072 INFO L225 Difference]: With dead ends: 1289 [2018-02-04 02:03:24,072 INFO L226 Difference]: Without dead ends: 1289 [2018-02-04 02:03:24,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-02-04 02:03:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1220. [2018-02-04 02:03:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-02-04 02:03:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1744 transitions. [2018-02-04 02:03:24,105 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1744 transitions. Word has length 26 [2018-02-04 02:03:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:24,106 INFO L432 AbstractCegarLoop]: Abstraction has 1220 states and 1744 transitions. [2018-02-04 02:03:24,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:03:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1744 transitions. [2018-02-04 02:03:24,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:03:24,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:24,107 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:24,107 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:24,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-04 02:03:24,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:24,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:24,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:24,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:24,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:24,189 INFO L182 omatonBuilderFactory]: Interpolants [7328#(not (= 1 ~pc4)), 7329#|main_#t~short13|, 7321#true, 7322#false, 7323#(or (not (= 1 ~pc4)) (not (= 1 ~pc1)) (not |main_#t~short13|)), 7324#(or (not (= 1 ~pc4)) (not (= 1 ~pc1))), 7325#(= |old(~pc1)| ~pc1), 7326#(or (= 1 |old(~pc1)|) (not |push_#t~switch1|)), 7327#(= 1 |old(~pc1)|)] [2018-02-04 02:03:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:24,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:24,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:24,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:24,190 INFO L87 Difference]: Start difference. First operand 1220 states and 1744 transitions. Second operand 9 states. [2018-02-04 02:03:24,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:24,550 INFO L93 Difference]: Finished difference Result 2132 states and 3383 transitions. [2018-02-04 02:03:24,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:03:24,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-04 02:03:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:24,560 INFO L225 Difference]: With dead ends: 2132 [2018-02-04 02:03:24,560 INFO L226 Difference]: Without dead ends: 2132 [2018-02-04 02:03:24,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:03:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2018-02-04 02:03:24,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 1670. [2018-02-04 02:03:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1670 states. [2018-02-04 02:03:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2410 transitions. [2018-02-04 02:03:24,619 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2410 transitions. Word has length 27 [2018-02-04 02:03:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:24,619 INFO L432 AbstractCegarLoop]: Abstraction has 1670 states and 2410 transitions. [2018-02-04 02:03:24,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2410 transitions. [2018-02-04 02:03:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:03:24,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:24,621 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:24,621 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:24,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-02-04 02:03:24,621 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:24,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:24,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:24,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:24,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:24,695 INFO L182 omatonBuilderFactory]: Interpolants [11158#true, 11159#false, 11160#(<= 1 ~pc4), 11161#(or (and (<= 1 ~pc1) (= 1 ~pc4)) |main_#t~short13|), 11162#(and (<= 1 ~pc1) (= 1 ~pc4)), 11163#(= |old(~pc1)| ~pc1), 11164#(<= (+ |old(~pc1)| 1) ~pc1), 11165#(<= 2 ~pc1), 11166#|main_#t~short13|] [2018-02-04 02:03:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:24,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:24,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:24,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:24,696 INFO L87 Difference]: Start difference. First operand 1670 states and 2410 transitions. Second operand 9 states. [2018-02-04 02:03:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:25,292 INFO L93 Difference]: Finished difference Result 4260 states and 6669 transitions. [2018-02-04 02:03:25,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 02:03:25,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-04 02:03:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:25,311 INFO L225 Difference]: With dead ends: 4260 [2018-02-04 02:03:25,311 INFO L226 Difference]: Without dead ends: 4260 [2018-02-04 02:03:25,312 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:03:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2018-02-04 02:03:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 3380. [2018-02-04 02:03:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3380 states. [2018-02-04 02:03:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4867 transitions. [2018-02-04 02:03:25,411 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4867 transitions. Word has length 27 [2018-02-04 02:03:25,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:25,411 INFO L432 AbstractCegarLoop]: Abstraction has 3380 states and 4867 transitions. [2018-02-04 02:03:25,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4867 transitions. [2018-02-04 02:03:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:03:25,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:25,413 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:25,413 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:25,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-04 02:03:25,414 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:25,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:25,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:25,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:03:25,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:25,477 INFO L182 omatonBuilderFactory]: Interpolants [18851#true, 18852#false, 18853#(and (= ~pc4 1) (= ~pc4 ~pc1)), 18854#(= 1 ~pc1), 18855#(= |old(~pc1)| ~pc1), 18856#(or (not (= |old(~pc1)| 1)) |push_#t~switch1|), 18857#(not (= |old(~pc1)| 1))] [2018-02-04 02:03:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:25,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:03:25,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:03:25,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:03:25,478 INFO L87 Difference]: Start difference. First operand 3380 states and 4867 transitions. Second operand 7 states. [2018-02-04 02:03:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:25,658 INFO L93 Difference]: Finished difference Result 2106 states and 2718 transitions. [2018-02-04 02:03:25,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:03:25,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 02:03:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:25,665 INFO L225 Difference]: With dead ends: 2106 [2018-02-04 02:03:25,666 INFO L226 Difference]: Without dead ends: 1890 [2018-02-04 02:03:25,666 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:03:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2018-02-04 02:03:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1637. [2018-02-04 02:03:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2018-02-04 02:03:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2190 transitions. [2018-02-04 02:03:25,703 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2190 transitions. Word has length 31 [2018-02-04 02:03:25,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:25,704 INFO L432 AbstractCegarLoop]: Abstraction has 1637 states and 2190 transitions. [2018-02-04 02:03:25,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:03:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2190 transitions. [2018-02-04 02:03:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:03:25,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:25,705 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:25,705 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:25,705 INFO L82 PathProgramCache]: Analyzing trace with hash 735152201, now seen corresponding path program 1 times [2018-02-04 02:03:25,705 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:25,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:25,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:25,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:03:25,840 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:25,841 INFO L182 omatonBuilderFactory]: Interpolants [22608#false, 22609#(and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 1 |pop_#t~post7|)) (or (<= (+ |pop_#t~post7| 1) ~pc4) (<= |pop_#t~post7| 2))), 22610#(or (and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 1 |pop_#t~post7|)) (or (<= (+ |pop_#t~post7| 1) ~pc4) (<= |pop_#t~post7| 2)) (not (= |pop_#t~post7| 2))) |pop_#t~switch8|), 22611#(and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 1 |pop_#t~post7|)) (or (<= (+ |pop_#t~post7| 1) ~pc4) (<= |pop_#t~post7| 2)) (not (= |pop_#t~post7| 2))), 22612#(or (<= ~pc4 2) (<= 4 ~pc4)), 22613#(or (<= 4 |pop_#t~post7|) (<= |pop_#t~post7| 2)), 22614#(not |pop_#t~switch8|), 22607#true] [2018-02-04 02:03:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:25,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:03:25,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:03:25,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:03:25,842 INFO L87 Difference]: Start difference. First operand 1637 states and 2190 transitions. Second operand 8 states. [2018-02-04 02:03:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:26,054 INFO L93 Difference]: Finished difference Result 2302 states and 3066 transitions. [2018-02-04 02:03:26,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:26,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 02:03:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:26,062 INFO L225 Difference]: With dead ends: 2302 [2018-02-04 02:03:26,062 INFO L226 Difference]: Without dead ends: 2302 [2018-02-04 02:03:26,063 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:03:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2018-02-04 02:03:26,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2249. [2018-02-04 02:03:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2249 states. [2018-02-04 02:03:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 3017 transitions. [2018-02-04 02:03:26,106 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 3017 transitions. Word has length 31 [2018-02-04 02:03:26,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:26,106 INFO L432 AbstractCegarLoop]: Abstraction has 2249 states and 3017 transitions. [2018-02-04 02:03:26,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:03:26,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 3017 transitions. [2018-02-04 02:03:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:03:26,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:26,107 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:26,107 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2106794323, now seen corresponding path program 1 times [2018-02-04 02:03:26,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:26,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:26,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:26,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:03:26,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:26,205 INFO L182 omatonBuilderFactory]: Interpolants [27184#(or (<= ~pc4 4) (<= 6 ~pc4)), 27185#(or (<= 6 |pop_#t~post7|) (<= |pop_#t~post7| 4)), 27186#(not |pop_#t~switch8|), 27180#true, 27181#false, 27182#(and (or (<= (+ |pop_#t~post7| 1) ~pc4) (<= |pop_#t~post7| 4)) (or (< 3 |pop_#t~post7|) (<= ~pc4 (+ |pop_#t~post7| 1)))), 27183#(or |pop_#t~switch8| (and (or (and (<= (+ |pop_#t~post7| 1) ~pc4) (not (= |pop_#t~post7| 4))) (<= |pop_#t~post7| 3)) (or (< 3 |pop_#t~post7|) (<= ~pc4 (+ |pop_#t~post7| 1)))))] [2018-02-04 02:03:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:26,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:03:26,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:03:26,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:03:26,206 INFO L87 Difference]: Start difference. First operand 2249 states and 3017 transitions. Second operand 7 states. [2018-02-04 02:03:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:26,483 INFO L93 Difference]: Finished difference Result 2862 states and 3817 transitions. [2018-02-04 02:03:26,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:03:26,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-04 02:03:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:26,494 INFO L225 Difference]: With dead ends: 2862 [2018-02-04 02:03:26,494 INFO L226 Difference]: Without dead ends: 2862 [2018-02-04 02:03:26,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:03:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2018-02-04 02:03:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2805. [2018-02-04 02:03:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. [2018-02-04 02:03:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 3760 transitions. [2018-02-04 02:03:26,549 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 3760 transitions. Word has length 33 [2018-02-04 02:03:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:26,549 INFO L432 AbstractCegarLoop]: Abstraction has 2805 states and 3760 transitions. [2018-02-04 02:03:26,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:03:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 3760 transitions. [2018-02-04 02:03:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:03:26,550 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:26,550 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:26,551 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:26,551 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-04 02:03:26,551 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:26,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:26,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:26,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:03:26,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:26,658 INFO L182 omatonBuilderFactory]: Interpolants [32868#true, 32869#false, 32870#(and (= 0 ~S.base) (= 0 ~S.offset)), 32871#(and (= |old(~S.offset)| ~S.offset) (= ~S.base |old(~S.base)|)), 32872#(and (= |old(~S.offset)| ~t4.offset) (= ~t4.base |old(~S.base)|)), 32873#(and (= 0 ~t4.base) (= 0 ~t4.offset)), 32874#(and (= ~t4.offset |old(~t4.offset)|) (= ~t4.base |old(~t4.base)|)), 32875#(or (not (= |old(~t4.offset)| 0)) (not (= 0 |old(~t4.base)|)))] [2018-02-04 02:03:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:26,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:03:26,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:03:26,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:03:26,658 INFO L87 Difference]: Start difference. First operand 2805 states and 3760 transitions. Second operand 8 states. [2018-02-04 02:03:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:27,036 INFO L93 Difference]: Finished difference Result 6136 states and 8404 transitions. [2018-02-04 02:03:27,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:03:27,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 02:03:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:27,057 INFO L225 Difference]: With dead ends: 6136 [2018-02-04 02:03:27,057 INFO L226 Difference]: Without dead ends: 6136 [2018-02-04 02:03:27,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2018-02-04 02:03:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 5433. [2018-02-04 02:03:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5433 states. [2018-02-04 02:03:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5433 states to 5433 states and 7288 transitions. [2018-02-04 02:03:27,164 INFO L78 Accepts]: Start accepts. Automaton has 5433 states and 7288 transitions. Word has length 38 [2018-02-04 02:03:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:27,164 INFO L432 AbstractCegarLoop]: Abstraction has 5433 states and 7288 transitions. [2018-02-04 02:03:27,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:03:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 5433 states and 7288 transitions. [2018-02-04 02:03:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 02:03:27,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:27,166 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:27,166 INFO L371 AbstractCegarLoop]: === Iteration 16 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:27,166 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-04 02:03:27,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:27,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:03:27,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:27,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:03:27,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:27,269 INFO L182 omatonBuilderFactory]: Interpolants [44464#true, 44465#false, 44466#(<= ~pc4 1), 44467#(or (and (<= ~pc1 1) (= 1 ~pc4)) |main_#t~short13|), 44468#(and (<= ~pc1 1) (= 1 ~pc4)), 44469#(= |old(~pc1)| ~pc1), 44470#(<= ~pc1 (+ |old(~pc1)| 1)), 44471#(<= ~pc1 2), 44472#(= |push_#t~post0| |old(~pc1)|), 44473#(or (<= 6 |old(~pc1)|) (not |push_#t~switch1|)), 44474#(<= 6 |old(~pc1)|)] [2018-02-04 02:03:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:03:27,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:03:27,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:03:27,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:03:27,269 INFO L87 Difference]: Start difference. First operand 5433 states and 7288 transitions. Second operand 11 states. [2018-02-04 02:03:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:28,096 INFO L93 Difference]: Finished difference Result 8495 states and 12756 transitions. [2018-02-04 02:03:28,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 02:03:28,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-04 02:03:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:28,141 INFO L225 Difference]: With dead ends: 8495 [2018-02-04 02:03:28,141 INFO L226 Difference]: Without dead ends: 8495 [2018-02-04 02:03:28,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:03:28,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8495 states. [2018-02-04 02:03:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8495 to 6632. [2018-02-04 02:03:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6632 states. [2018-02-04 02:03:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6632 states to 6632 states and 9025 transitions. [2018-02-04 02:03:28,308 INFO L78 Accepts]: Start accepts. Automaton has 6632 states and 9025 transitions. Word has length 42 [2018-02-04 02:03:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:28,308 INFO L432 AbstractCegarLoop]: Abstraction has 6632 states and 9025 transitions. [2018-02-04 02:03:28,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:03:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 6632 states and 9025 transitions. [2018-02-04 02:03:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 02:03:28,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:28,310 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:28,310 INFO L371 AbstractCegarLoop]: === Iteration 17 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1272667095, now seen corresponding path program 1 times [2018-02-04 02:03:28,311 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:28,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 02:03:28,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:28,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:03:28,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:28,375 INFO L182 omatonBuilderFactory]: Interpolants [59656#true, 59657#false, 59658#(or (not |pop_#t~switch8|) (<= 2 ~pc4)), 59659#(<= 2 ~pc4), 59660#|main_#t~short13|] [2018-02-04 02:03:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 02:03:28,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:03:28,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:03:28,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:03:28,376 INFO L87 Difference]: Start difference. First operand 6632 states and 9025 transitions. Second operand 5 states. [2018-02-04 02:03:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:28,438 INFO L93 Difference]: Finished difference Result 8298 states and 11518 transitions. [2018-02-04 02:03:28,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:03:28,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-04 02:03:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:28,463 INFO L225 Difference]: With dead ends: 8298 [2018-02-04 02:03:28,463 INFO L226 Difference]: Without dead ends: 8298 [2018-02-04 02:03:28,464 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:03:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8298 states. [2018-02-04 02:03:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8298 to 8109. [2018-02-04 02:03:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8109 states. [2018-02-04 02:03:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8109 states to 8109 states and 11245 transitions. [2018-02-04 02:03:28,634 INFO L78 Accepts]: Start accepts. Automaton has 8109 states and 11245 transitions. Word has length 47 [2018-02-04 02:03:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:28,635 INFO L432 AbstractCegarLoop]: Abstraction has 8109 states and 11245 transitions. [2018-02-04 02:03:28,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:03:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 8109 states and 11245 transitions. [2018-02-04 02:03:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 02:03:28,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:28,637 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:28,637 INFO L371 AbstractCegarLoop]: === Iteration 18 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:28,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1079771155, now seen corresponding path program 1 times [2018-02-04 02:03:28,638 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:28,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:28,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:28,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:03:28,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:28,784 INFO L182 omatonBuilderFactory]: Interpolants [76071#false, 76070#true, 76073#(or (and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 2 |pop_#t~post7|)) (or (and (<= (+ |pop_#t~post7| 1) ~pc4) (not (= |pop_#t~post7| 3))) (<= |pop_#t~post7| 2))) |pop_#t~switch8|), 76072#(and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 2 |pop_#t~post7|)) (or (<= (+ |pop_#t~post7| 1) ~pc4) (<= |pop_#t~post7| 3))), 76075#(or (<= 5 ~pc4) (<= ~pc4 3)), 76074#(and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 2 |pop_#t~post7|)) (or (and (<= (+ |pop_#t~post7| 1) ~pc4) (not (= |pop_#t~post7| 3))) (<= |pop_#t~post7| 2))), 76077#(= |pop_#t~post7| |old(~pc4)|), 76076#(= |old(~pc4)| ~pc4), 76079#(and (<= |old(~pc4)| 4) (<= 4 |old(~pc4)|)), 76078#(or (not |pop_#t~switch8|) (and (<= |old(~pc4)| 4) (<= 4 |old(~pc4)|)))] [2018-02-04 02:03:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:28,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:03:28,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:03:28,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:03:28,785 INFO L87 Difference]: Start difference. First operand 8109 states and 11245 transitions. Second operand 10 states. [2018-02-04 02:03:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:29,087 INFO L93 Difference]: Finished difference Result 7737 states and 10589 transitions. [2018-02-04 02:03:29,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:29,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-02-04 02:03:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:29,109 INFO L225 Difference]: With dead ends: 7737 [2018-02-04 02:03:29,109 INFO L226 Difference]: Without dead ends: 7578 [2018-02-04 02:03:29,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:03:29,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7578 states. [2018-02-04 02:03:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7578 to 7325. [2018-02-04 02:03:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7325 states. [2018-02-04 02:03:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7325 states to 7325 states and 10085 transitions. [2018-02-04 02:03:29,233 INFO L78 Accepts]: Start accepts. Automaton has 7325 states and 10085 transitions. Word has length 47 [2018-02-04 02:03:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:29,233 INFO L432 AbstractCegarLoop]: Abstraction has 7325 states and 10085 transitions. [2018-02-04 02:03:29,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:03:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 7325 states and 10085 transitions. [2018-02-04 02:03:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 02:03:29,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:29,235 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:29,235 INFO L371 AbstractCegarLoop]: === Iteration 19 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:29,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1244589299, now seen corresponding path program 1 times [2018-02-04 02:03:29,236 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:29,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 02:03:29,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:29,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:03:29,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:29,308 INFO L182 omatonBuilderFactory]: Interpolants [91159#true, 91161#(<= 1 ~pc1), 91160#false, 91163#(<= (+ |old(~pc1)| 1) ~pc1), 91162#(= |old(~pc1)| ~pc1), 91165#(not (= ~pc1 1)), 91164#(<= 2 ~pc1), 91166#|main_#t~short13|] [2018-02-04 02:03:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 02:03:29,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:03:29,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:03:29,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:03:29,308 INFO L87 Difference]: Start difference. First operand 7325 states and 10085 transitions. Second operand 8 states. [2018-02-04 02:03:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:29,534 INFO L93 Difference]: Finished difference Result 7367 states and 10515 transitions. [2018-02-04 02:03:29,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:29,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-02-04 02:03:29,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:29,559 INFO L225 Difference]: With dead ends: 7367 [2018-02-04 02:03:29,559 INFO L226 Difference]: Without dead ends: 7367 [2018-02-04 02:03:29,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:03:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7367 states. [2018-02-04 02:03:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7367 to 6477. [2018-02-04 02:03:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6477 states. [2018-02-04 02:03:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6477 states to 6477 states and 8746 transitions. [2018-02-04 02:03:29,704 INFO L78 Accepts]: Start accepts. Automaton has 6477 states and 8746 transitions. Word has length 49 [2018-02-04 02:03:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:29,704 INFO L432 AbstractCegarLoop]: Abstraction has 6477 states and 8746 transitions. [2018-02-04 02:03:29,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:03:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 6477 states and 8746 transitions. [2018-02-04 02:03:29,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 02:03:29,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:29,706 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:29,706 INFO L371 AbstractCegarLoop]: === Iteration 20 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:29,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-04 02:03:29,706 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:29,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:29,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:29,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:29,777 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:29,777 INFO L182 omatonBuilderFactory]: Interpolants [105027#true, 105029#(<= ~pc1 (+ |push_#t~post0| 1)), 105028#false, 105031#(<= ~pc1 3), 105030#(or (<= ~pc1 3) (not |push_#t~switch1|)), 105033#(= |push_#t~post0| |old(~pc1)|), 105032#(= |old(~pc1)| ~pc1), 105035#(<= 6 |old(~pc1)|), 105034#(or (<= 6 |old(~pc1)|) (not |push_#t~switch1|))] [2018-02-04 02:03:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:29,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:29,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:29,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:29,778 INFO L87 Difference]: Start difference. First operand 6477 states and 8746 transitions. Second operand 9 states. [2018-02-04 02:03:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:30,091 INFO L93 Difference]: Finished difference Result 8859 states and 12409 transitions. [2018-02-04 02:03:30,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:30,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-02-04 02:03:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:30,119 INFO L225 Difference]: With dead ends: 8859 [2018-02-04 02:03:30,119 INFO L226 Difference]: Without dead ends: 8859 [2018-02-04 02:03:30,120 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:30,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8859 states. [2018-02-04 02:03:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8859 to 3723. [2018-02-04 02:03:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3723 states. [2018-02-04 02:03:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 5053 transitions. [2018-02-04 02:03:30,229 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 5053 transitions. Word has length 54 [2018-02-04 02:03:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:30,230 INFO L432 AbstractCegarLoop]: Abstraction has 3723 states and 5053 transitions. [2018-02-04 02:03:30,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5053 transitions. [2018-02-04 02:03:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 02:03:30,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:30,233 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:30,233 INFO L371 AbstractCegarLoop]: === Iteration 21 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:30,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-04 02:03:30,234 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:30,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:30,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:30,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:30,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:30,310 INFO L182 omatonBuilderFactory]: Interpolants [117648#(<= 6 |old(~pc1)|), 117641#false, 117640#true, 117643#(or (<= ~pc1 4) (not |push_#t~switch1|)), 117642#(<= ~pc1 (+ |push_#t~post0| 1)), 117645#(= |old(~pc1)| ~pc1), 117644#(<= ~pc1 4), 117647#(or (<= 6 |old(~pc1)|) (not |push_#t~switch1|)), 117646#(= |push_#t~post0| |old(~pc1)|)] [2018-02-04 02:03:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:30,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:30,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:30,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:30,311 INFO L87 Difference]: Start difference. First operand 3723 states and 5053 transitions. Second operand 9 states. [2018-02-04 02:03:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:30,531 INFO L93 Difference]: Finished difference Result 4672 states and 6614 transitions. [2018-02-04 02:03:30,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:30,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-02-04 02:03:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:30,544 INFO L225 Difference]: With dead ends: 4672 [2018-02-04 02:03:30,544 INFO L226 Difference]: Without dead ends: 4672 [2018-02-04 02:03:30,545 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4672 states. [2018-02-04 02:03:30,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4672 to 3723. [2018-02-04 02:03:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3723 states. [2018-02-04 02:03:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 5053 transitions. [2018-02-04 02:03:30,680 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 5053 transitions. Word has length 54 [2018-02-04 02:03:30,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:30,680 INFO L432 AbstractCegarLoop]: Abstraction has 3723 states and 5053 transitions. [2018-02-04 02:03:30,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5053 transitions. [2018-02-04 02:03:30,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 02:03:30,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:30,683 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:30,683 INFO L371 AbstractCegarLoop]: === Iteration 22 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:30,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1006007847, now seen corresponding path program 1 times [2018-02-04 02:03:30,684 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:30,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:30,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:30,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:30,754 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:30,755 INFO L182 omatonBuilderFactory]: Interpolants [126067#false, 126066#true, 126069#(or (<= ~pc1 5) (not |push_#t~switch1|)), 126068#(<= ~pc1 (+ |push_#t~post0| 1)), 126071#(= |old(~pc1)| ~pc1), 126070#(<= ~pc1 5), 126073#(or (<= 6 |old(~pc1)|) (not |push_#t~switch1|)), 126072#(= |push_#t~post0| |old(~pc1)|), 126074#(<= 6 |old(~pc1)|)] [2018-02-04 02:03:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:30,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:30,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:30,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:30,756 INFO L87 Difference]: Start difference. First operand 3723 states and 5053 transitions. Second operand 9 states. [2018-02-04 02:03:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:30,989 INFO L93 Difference]: Finished difference Result 4660 states and 6590 transitions. [2018-02-04 02:03:30,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:30,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-02-04 02:03:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:31,002 INFO L225 Difference]: With dead ends: 4660 [2018-02-04 02:03:31,002 INFO L226 Difference]: Without dead ends: 4660 [2018-02-04 02:03:31,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4660 states. [2018-02-04 02:03:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4660 to 3723. [2018-02-04 02:03:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3723 states. [2018-02-04 02:03:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 5053 transitions. [2018-02-04 02:03:31,069 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 5053 transitions. Word has length 56 [2018-02-04 02:03:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:31,069 INFO L432 AbstractCegarLoop]: Abstraction has 3723 states and 5053 transitions. [2018-02-04 02:03:31,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5053 transitions. [2018-02-04 02:03:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 02:03:31,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:31,071 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:31,071 INFO L371 AbstractCegarLoop]: === Iteration 23 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:31,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1207017357, now seen corresponding path program 1 times [2018-02-04 02:03:31,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:31,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 02:03:31,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:31,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:03:31,187 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:31,187 INFO L182 omatonBuilderFactory]: Interpolants [134482#(<= ~pc4 1), 134483#(or (and (<= ~pc1 1) (= 1 ~pc4)) |main_#t~short13|), 134480#true, 134481#false, 134486#(<= ~pc1 (+ |old(~pc1)| 1)), 134487#(<= ~pc1 2), 134484#(and (<= ~pc1 1) (= 1 ~pc4)), 134485#(= |old(~pc1)| ~pc1), 134490#(<= 5 |old(~pc1)|), 134488#(= |push_#t~post0| |old(~pc1)|), 134489#(or (<= 5 |old(~pc1)|) (not |push_#t~switch1|))] [2018-02-04 02:03:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 02:03:31,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:03:31,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:03:31,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:03:31,188 INFO L87 Difference]: Start difference. First operand 3723 states and 5053 transitions. Second operand 11 states. [2018-02-04 02:03:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:31,770 INFO L93 Difference]: Finished difference Result 5319 states and 7563 transitions. [2018-02-04 02:03:31,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 02:03:31,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-02-04 02:03:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:31,782 INFO L225 Difference]: With dead ends: 5319 [2018-02-04 02:03:31,782 INFO L226 Difference]: Without dead ends: 5319 [2018-02-04 02:03:31,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:03:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2018-02-04 02:03:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 4238. [2018-02-04 02:03:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4238 states. [2018-02-04 02:03:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 5837 transitions. [2018-02-04 02:03:31,878 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 5837 transitions. Word has length 57 [2018-02-04 02:03:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:31,878 INFO L432 AbstractCegarLoop]: Abstraction has 4238 states and 5837 transitions. [2018-02-04 02:03:31,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:03:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 5837 transitions. [2018-02-04 02:03:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 02:03:31,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:31,880 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:31,880 INFO L371 AbstractCegarLoop]: === Iteration 24 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:31,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1674128402, now seen corresponding path program 1 times [2018-02-04 02:03:31,881 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:32,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:32,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:32,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:32,090 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:32,090 INFO L182 omatonBuilderFactory]: Interpolants [144114#(= |push_#t~post0| |old(~pc1)|), 144115#(or (and (<= 6 |old(~pc1)|) (<= |old(~pc1)| 6)) (not |push_#t~switch1|)), 144112#(or (<= 7 ~pc1) (<= ~pc1 5)), 144113#(= |old(~pc1)| ~pc1), 144116#(and (<= 6 |old(~pc1)|) (<= |old(~pc1)| 6)), 144110#(and (or (<= |push_#t~post0| 5) (<= (+ |push_#t~post0| 1) ~pc1)) (or (< 4 |push_#t~post0|) (<= ~pc1 (+ |push_#t~post0| 1)))), 144111#(or (and (not (= |push_#t~post0| 5)) (or (<= |push_#t~post0| 5) (<= (+ |push_#t~post0| 1) ~pc1)) (or (< 4 |push_#t~post0|) (<= ~pc1 (+ |push_#t~post0| 1)))) |push_#t~switch1|), 144108#true, 144109#false] [2018-02-04 02:03:32,091 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:32,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:32,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:32,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:32,091 INFO L87 Difference]: Start difference. First operand 4238 states and 5837 transitions. Second operand 9 states. [2018-02-04 02:03:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:32,457 INFO L93 Difference]: Finished difference Result 5531 states and 8015 transitions. [2018-02-04 02:03:32,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:03:32,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-02-04 02:03:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:32,466 INFO L225 Difference]: With dead ends: 5531 [2018-02-04 02:03:32,466 INFO L226 Difference]: Without dead ends: 5519 [2018-02-04 02:03:32,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:03:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2018-02-04 02:03:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 3705. [2018-02-04 02:03:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3705 states. [2018-02-04 02:03:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 5056 transitions. [2018-02-04 02:03:32,533 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 5056 transitions. Word has length 58 [2018-02-04 02:03:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:32,533 INFO L432 AbstractCegarLoop]: Abstraction has 3705 states and 5056 transitions. [2018-02-04 02:03:32,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 5056 transitions. [2018-02-04 02:03:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 02:03:32,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:32,535 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:32,535 INFO L371 AbstractCegarLoop]: === Iteration 25 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:32,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1808001510, now seen corresponding path program 1 times [2018-02-04 02:03:32,536 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:32,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 50 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 02:03:32,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:32,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:32,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:32,626 INFO L182 omatonBuilderFactory]: Interpolants [153378#(<= 5 |old(~pc1)|), 153376#(= |push_#t~post0| |old(~pc1)|), 153377#(or (<= 5 |old(~pc1)|) (not |push_#t~switch1|)), 153370#true, 153371#false, 153374#(<= ~pc1 3), 153375#(= |old(~pc1)| ~pc1), 153372#(<= ~pc1 (+ |push_#t~post0| 1)), 153373#(or (<= ~pc1 3) (not |push_#t~switch1|))] [2018-02-04 02:03:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 50 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 02:03:32,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:32,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:32,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:32,627 INFO L87 Difference]: Start difference. First operand 3705 states and 5056 transitions. Second operand 9 states. [2018-02-04 02:03:32,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:32,861 INFO L93 Difference]: Finished difference Result 4590 states and 6465 transitions. [2018-02-04 02:03:32,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:32,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-02-04 02:03:32,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:32,871 INFO L225 Difference]: With dead ends: 4590 [2018-02-04 02:03:32,871 INFO L226 Difference]: Without dead ends: 4590 [2018-02-04 02:03:32,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:32,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4590 states. [2018-02-04 02:03:32,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4590 to 4352. [2018-02-04 02:03:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4352 states. [2018-02-04 02:03:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4352 states to 4352 states and 6028 transitions. [2018-02-04 02:03:32,936 INFO L78 Accepts]: Start accepts. Automaton has 4352 states and 6028 transitions. Word has length 69 [2018-02-04 02:03:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:32,936 INFO L432 AbstractCegarLoop]: Abstraction has 4352 states and 6028 transitions. [2018-02-04 02:03:32,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4352 states and 6028 transitions. [2018-02-04 02:03:32,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 02:03:32,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:32,938 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2018-02-04 02:03:32,938 INFO L371 AbstractCegarLoop]: === Iteration 26 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash -719732632, now seen corresponding path program 1 times [2018-02-04 02:03:32,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:32,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 02:03:33,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:33,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:33,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:33,021 INFO L182 omatonBuilderFactory]: Interpolants [162342#true, 162343#false, 162346#(<= ~pc1 4), 162347#(= |old(~pc1)| ~pc1), 162344#(<= ~pc1 (+ |push_#t~post0| 1)), 162345#(or (<= ~pc1 4) (not |push_#t~switch1|)), 162350#(<= 5 |old(~pc1)|), 162348#(= |push_#t~post0| |old(~pc1)|), 162349#(or (<= 5 |old(~pc1)|) (not |push_#t~switch1|))] [2018-02-04 02:03:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 02:03:33,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:33,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:33,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:33,022 INFO L87 Difference]: Start difference. First operand 4352 states and 6028 transitions. Second operand 9 states. [2018-02-04 02:03:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:33,312 INFO L93 Difference]: Finished difference Result 5203 states and 7467 transitions. [2018-02-04 02:03:33,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:33,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-02-04 02:03:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:33,319 INFO L225 Difference]: With dead ends: 5203 [2018-02-04 02:03:33,319 INFO L226 Difference]: Without dead ends: 5203 [2018-02-04 02:03:33,320 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:33,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5203 states. [2018-02-04 02:03:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5203 to 4352. [2018-02-04 02:03:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4352 states. [2018-02-04 02:03:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4352 states to 4352 states and 6028 transitions. [2018-02-04 02:03:33,375 INFO L78 Accepts]: Start accepts. Automaton has 4352 states and 6028 transitions. Word has length 69 [2018-02-04 02:03:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:33,375 INFO L432 AbstractCegarLoop]: Abstraction has 4352 states and 6028 transitions. [2018-02-04 02:03:33,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4352 states and 6028 transitions. [2018-02-04 02:03:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 02:03:33,377 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:33,378 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:33,378 INFO L371 AbstractCegarLoop]: === Iteration 27 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:33,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1363287658, now seen corresponding path program 1 times [2018-02-04 02:03:33,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:33,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 32 proven. 31 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 02:03:33,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:33,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:03:33,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:33,489 INFO L182 omatonBuilderFactory]: Interpolants [171936#(or (<= 4 |old(~pc1)|) (not |push_#t~switch1|)), 171937#(<= 4 |old(~pc1)|), 171927#true, 171930#(or (and (<= ~pc1 1) (= 1 ~pc4)) |main_#t~short13|), 171931#(and (<= ~pc1 1) (= 1 ~pc4)), 171928#false, 171929#(<= ~pc4 1), 171934#(<= ~pc1 2), 171935#(= |push_#t~post0| |old(~pc1)|), 171932#(= |old(~pc1)| ~pc1), 171933#(<= ~pc1 (+ |old(~pc1)| 1))] [2018-02-04 02:03:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 32 proven. 31 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 02:03:33,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:03:33,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:03:33,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:03:33,490 INFO L87 Difference]: Start difference. First operand 4352 states and 6028 transitions. Second operand 11 states. [2018-02-04 02:03:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:33,987 INFO L93 Difference]: Finished difference Result 5982 states and 8678 transitions. [2018-02-04 02:03:33,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 02:03:33,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-02-04 02:03:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:34,000 INFO L225 Difference]: With dead ends: 5982 [2018-02-04 02:03:34,000 INFO L226 Difference]: Without dead ends: 5982 [2018-02-04 02:03:34,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:03:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2018-02-04 02:03:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 4761. [2018-02-04 02:03:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4761 states. [2018-02-04 02:03:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 6692 transitions. [2018-02-04 02:03:34,100 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 6692 transitions. Word has length 71 [2018-02-04 02:03:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:34,100 INFO L432 AbstractCegarLoop]: Abstraction has 4761 states and 6692 transitions. [2018-02-04 02:03:34,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:03:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 6692 transitions. [2018-02-04 02:03:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 02:03:34,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:34,103 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:34,103 INFO L371 AbstractCegarLoop]: === Iteration 28 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:34,103 INFO L82 PathProgramCache]: Analyzing trace with hash 613337013, now seen corresponding path program 1 times [2018-02-04 02:03:34,104 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:34,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 50 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 02:03:34,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:34,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:03:34,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:34,253 INFO L182 omatonBuilderFactory]: Interpolants [182742#false, 182743#(and (or (<= |push_#t~post0| 4) (<= (+ |push_#t~post0| 1) ~pc1)) (or (<= ~pc1 (+ |push_#t~post0| 1)) (< 3 |push_#t~post0|))), 182741#true, 182746#(or (<= 6 ~pc1) (<= ~pc1 4)), 182747#(= |old(~pc1)| ~pc1), 182744#(or (and (or (<= |push_#t~post0| 4) (<= (+ |push_#t~post0| 1) ~pc1)) (not (= |push_#t~post0| 4)) (or (<= ~pc1 (+ |push_#t~post0| 1)) (< 3 |push_#t~post0|))) |push_#t~switch1|), 182745#(and (or (<= |push_#t~post0| 4) (<= (+ |push_#t~post0| 1) ~pc1)) (not (= |push_#t~post0| 4)) (or (<= ~pc1 (+ |push_#t~post0| 1)) (< 3 |push_#t~post0|))), 182750#(and (<= |old(~pc1)| 5) (<= 5 |old(~pc1)|)), 182748#(= |push_#t~post0| |old(~pc1)|), 182749#(or (and (<= |old(~pc1)| 5) (<= 5 |old(~pc1)|)) (not |push_#t~switch1|))] [2018-02-04 02:03:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 50 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 02:03:34,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:03:34,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:03:34,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:03:34,254 INFO L87 Difference]: Start difference. First operand 4761 states and 6692 transitions. Second operand 10 states. [2018-02-04 02:03:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:34,479 INFO L93 Difference]: Finished difference Result 6142 states and 8814 transitions. [2018-02-04 02:03:34,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:34,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-02-04 02:03:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:34,489 INFO L225 Difference]: With dead ends: 6142 [2018-02-04 02:03:34,489 INFO L226 Difference]: Without dead ends: 6142 [2018-02-04 02:03:34,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:03:34,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6142 states. [2018-02-04 02:03:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6142 to 4446. [2018-02-04 02:03:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4446 states. [2018-02-04 02:03:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4446 states to 4446 states and 6103 transitions. [2018-02-04 02:03:34,701 INFO L78 Accepts]: Start accepts. Automaton has 4446 states and 6103 transitions. Word has length 73 [2018-02-04 02:03:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:34,701 INFO L432 AbstractCegarLoop]: Abstraction has 4446 states and 6103 transitions. [2018-02-04 02:03:34,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:03:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4446 states and 6103 transitions. [2018-02-04 02:03:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 02:03:34,703 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:34,703 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:34,703 INFO L371 AbstractCegarLoop]: === Iteration 29 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:34,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1381719395, now seen corresponding path program 1 times [2018-02-04 02:03:34,704 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:34,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 68 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 02:03:34,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:34,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:34,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:03:34,758 INFO L182 omatonBuilderFactory]: Interpolants [193362#(<= ~pc1 (+ |push_#t~post0| 1)), 193363#(or (<= ~pc1 3) (not |push_#t~switch1|)), 193360#true, 193361#false, 193366#(= |push_#t~post0| |old(~pc1)|), 193367#(or (<= 4 |old(~pc1)|) (not |push_#t~switch1|)), 193364#(<= ~pc1 3), 193365#(= |old(~pc1)| ~pc1), 193368#(<= 4 |old(~pc1)|)] [2018-02-04 02:03:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 68 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 02:03:34,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:34,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:34,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:34,758 INFO L87 Difference]: Start difference. First operand 4446 states and 6103 transitions. Second operand 9 states. [2018-02-04 02:03:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:34,994 INFO L93 Difference]: Finished difference Result 5297 states and 7554 transitions. [2018-02-04 02:03:34,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:34,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-02-04 02:03:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:35,002 INFO L225 Difference]: With dead ends: 5297 [2018-02-04 02:03:35,003 INFO L226 Difference]: Without dead ends: 5297 [2018-02-04 02:03:35,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5297 states. [2018-02-04 02:03:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5297 to 5059. [2018-02-04 02:03:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5059 states. [2018-02-04 02:03:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5059 states to 5059 states and 7071 transitions. [2018-02-04 02:03:35,074 INFO L78 Accepts]: Start accepts. Automaton has 5059 states and 7071 transitions. Word has length 83 [2018-02-04 02:03:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:35,075 INFO L432 AbstractCegarLoop]: Abstraction has 5059 states and 7071 transitions. [2018-02-04 02:03:35,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 7071 transitions. [2018-02-04 02:03:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 02:03:35,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:35,077 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:35,077 INFO L371 AbstractCegarLoop]: === Iteration 30 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:35,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1434980961, now seen corresponding path program 1 times [2018-02-04 02:03:35,078 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:35,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 44 proven. 39 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-02-04 02:03:35,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:35,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:03:35,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 02:03:35,186 INFO L182 omatonBuilderFactory]: Interpolants [203747#false, 203746#true, 203751#(= |old(~pc1)| ~pc1), 203750#(and (<= ~pc1 1) (= 1 ~pc4)), 203749#(or (and (<= ~pc1 1) (= 1 ~pc4)) |main_#t~short13|), 203748#(<= ~pc4 1), 203755#(or (<= 3 |old(~pc1)|) (not |push_#t~switch1|)), 203754#(= |push_#t~post0| |old(~pc1)|), 203753#(<= ~pc1 2), 203752#(<= ~pc1 (+ |old(~pc1)| 1)), 203756#(<= 3 |old(~pc1)|)] [2018-02-04 02:03:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 44 proven. 39 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-02-04 02:03:35,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:03:35,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:03:35,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:03:35,187 INFO L87 Difference]: Start difference. First operand 5059 states and 7071 transitions. Second operand 11 states. [2018-02-04 02:03:35,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:35,792 INFO L93 Difference]: Finished difference Result 6885 states and 10121 transitions. [2018-02-04 02:03:35,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 02:03:35,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-02-04 02:03:35,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:35,805 INFO L225 Difference]: With dead ends: 6885 [2018-02-04 02:03:35,805 INFO L226 Difference]: Without dead ends: 6885 [2018-02-04 02:03:35,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:03:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6885 states. [2018-02-04 02:03:35,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6885 to 5691. [2018-02-04 02:03:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5691 states. [2018-02-04 02:03:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5691 states to 5691 states and 8100 transitions. [2018-02-04 02:03:35,886 INFO L78 Accepts]: Start accepts. Automaton has 5691 states and 8100 transitions. Word has length 83 [2018-02-04 02:03:35,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:35,886 INFO L432 AbstractCegarLoop]: Abstraction has 5691 states and 8100 transitions. [2018-02-04 02:03:35,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:03:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 5691 states and 8100 transitions. [2018-02-04 02:03:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 02:03:35,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:35,890 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:35,890 INFO L371 AbstractCegarLoop]: === Iteration 31 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:35,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-02-04 02:03:35,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:35,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:36,095 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 22 DAG size of output 18 [2018-02-04 02:03:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 02:03:36,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:36,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:03:36,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:03:36,142 INFO L182 omatonBuilderFactory]: Interpolants [216402#(and (<= 4 |old(~pc1)|) (<= |old(~pc1)| 4)), 216401#(or (and (<= 4 |old(~pc1)|) (<= |old(~pc1)| 4)) (not |push_#t~switch1|)), 216400#(= |push_#t~post0| |old(~pc1)|), 216395#(and (or (<= |push_#t~post0| 3) (<= (+ |push_#t~post0| 1) ~pc1)) (or (< 2 |push_#t~post0|) (<= ~pc1 (+ |push_#t~post0| 1)))), 216394#false, 216393#true, 216399#(= |old(~pc1)| ~pc1), 216398#(or (<= 5 ~pc1) (<= ~pc1 3)), 216397#(and (or (and (<= (+ |push_#t~post0| 1) ~pc1) (not (= |push_#t~post0| 3))) (<= |push_#t~post0| 2)) (or (< 2 |push_#t~post0|) (<= ~pc1 (+ |push_#t~post0| 1)))), 216396#(or |push_#t~switch1| (and (or (and (<= (+ |push_#t~post0| 1) ~pc1) (not (= |push_#t~post0| 3))) (<= |push_#t~post0| 2)) (or (< 2 |push_#t~post0|) (<= ~pc1 (+ |push_#t~post0| 1)))))] [2018-02-04 02:03:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 02:03:36,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:03:36,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:03:36,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:03:36,143 INFO L87 Difference]: Start difference. First operand 5691 states and 8100 transitions. Second operand 10 states. [2018-02-04 02:03:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:36,389 INFO L93 Difference]: Finished difference Result 7111 states and 10295 transitions. [2018-02-04 02:03:36,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:36,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-02-04 02:03:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:36,400 INFO L225 Difference]: With dead ends: 7111 [2018-02-04 02:03:36,400 INFO L226 Difference]: Without dead ends: 7111 [2018-02-04 02:03:36,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:03:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7111 states. [2018-02-04 02:03:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7111 to 5153. [2018-02-04 02:03:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2018-02-04 02:03:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 7140 transitions. [2018-02-04 02:03:36,459 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 7140 transitions. Word has length 87 [2018-02-04 02:03:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:36,459 INFO L432 AbstractCegarLoop]: Abstraction has 5153 states and 7140 transitions. [2018-02-04 02:03:36,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:03:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 7140 transitions. [2018-02-04 02:03:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 02:03:36,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:36,462 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1] [2018-02-04 02:03:36,462 INFO L371 AbstractCegarLoop]: === Iteration 32 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1756447406, now seen corresponding path program 1 times [2018-02-04 02:03:36,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:03:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:03:36,539 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 02:03:36,583 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 02:03:36,592 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-02-04 02:03:36,593 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-02-04 02:03:36,594 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-02-04 02:03:36,595 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-02-04 02:03:36,595 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-02-04 02:03:36,597 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-02-04 02:03:36,598 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-02-04 02:03:36,600 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-02-04 02:03:36,602 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-02-04 02:03:36,602 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-02-04 02:03:36,604 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-02-04 02:03:36,604 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-02-04 02:03:36,605 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-02-04 02:03:36,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:03:36 BoogieIcfgContainer [2018-02-04 02:03:36,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:03:36,618 INFO L168 Benchmark]: Toolchain (without parser) took 14318.36 ms. Allocated memory was 407.4 MB in the beginning and 1.2 GB in the end (delta: 834.1 MB). Free memory was 361.4 MB in the beginning and 889.1 MB in the end (delta: -527.7 MB). Peak memory consumption was 306.5 MB. Max. memory is 5.3 GB. [2018-02-04 02:03:36,619 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 407.4 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:03:36,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.25 ms. Allocated memory is still 407.4 MB. Free memory was 361.4 MB in the beginning and 350.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:03:36,619 INFO L168 Benchmark]: Boogie Preprocessor took 23.59 ms. Allocated memory is still 407.4 MB. Free memory was 350.8 MB in the beginning and 348.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:03:36,620 INFO L168 Benchmark]: RCFGBuilder took 256.32 ms. Allocated memory is still 407.4 MB. Free memory was 348.2 MB in the beginning and 320.4 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-02-04 02:03:36,620 INFO L168 Benchmark]: TraceAbstraction took 13875.45 ms. Allocated memory was 407.4 MB in the beginning and 1.2 GB in the end (delta: 834.1 MB). Free memory was 320.4 MB in the beginning and 889.1 MB in the end (delta: -568.7 MB). Peak memory consumption was 265.4 MB. Max. memory is 5.3 GB. [2018-02-04 02:03:36,621 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.17 ms. Allocated memory is still 407.4 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.25 ms. Allocated memory is still 407.4 MB. Free memory was 361.4 MB in the beginning and 350.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.59 ms. Allocated memory is still 407.4 MB. Free memory was 350.8 MB in the beginning and 348.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 256.32 ms. Allocated memory is still 407.4 MB. Free memory was 348.2 MB in the beginning and 320.4 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 13875.45 ms. Allocated memory was 407.4 MB in the beginning and 1.2 GB in the end (delta: 834.1 MB). Free memory was 320.4 MB in the beginning and 889.1 MB in the end (delta: -568.7 MB). Peak memory consumption was 265.4 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 * 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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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] COND TRUE 1 != pc1 || 1 != pc4 || __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)=0, \old(x1)=12, \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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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] COND TRUE 1 != pc1 || 1 != pc4 || __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)=0, \old(x1)=12, \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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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] COND TRUE 1 != pc1 || 1 != pc4 || __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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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] COND TRUE 1 != pc1 || 1 != pc4 || __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)=12, \old(x1)=0, \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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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] COND TRUE 1 != pc1 || 1 != pc4 || __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)=12, \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=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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \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=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __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=1, res4=0, S={12:0}, t1={0:0}, t4={0: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=1, 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, 13.8s OverallTime, 32 OverallIterations, 7 TraceHistogramMax, 8.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2934 SDtfs, 5761 SDslu, 5985 SDs, 0 SdLazy, 7375 SolverSat, 1419 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 585 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2265 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8109occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 884/1169 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 23126 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1416 NumberOfCodeBlocks, 1416 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1290 ConstructedInterpolants, 0 QuantifiedInterpolants, 192553 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 10 PerfectInterpolantSequences, 884/1169 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-03-36-628.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-03-36-628.csv Received shutdown request...