java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:47:53,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:47:53,164 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:47:53,180 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:47:53,181 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:47:53,182 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:47:53,183 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:47:53,184 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:47:53,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:47:53,187 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:47:53,188 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:47:53,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:47:53,189 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:47:53,191 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:47:53,192 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:47:53,194 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:47:53,196 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:47:53,198 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:47:53,199 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:47:53,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:47:53,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:47:53,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:47:53,203 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:47:53,204 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:47:53,205 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:47:53,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:47:53,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:47:53,207 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:47:53,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:47:53,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:47:53,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:47:53,208 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:47:53,218 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:47:53,218 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:47:53,219 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:47:53,219 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:47:53,219 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:47:53,220 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:47:53,220 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:47:53,220 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:47:53,220 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:47:53,221 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:47:53,221 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:47:53,221 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:47:53,221 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:47:53,221 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:47:53,221 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:47:53,222 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:47:53,222 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:47:53,222 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:47:53,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:47:53,222 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:47:53,222 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:47:53,223 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:47:53,223 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:47:53,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:47:53,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:47:53,223 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:47:53,224 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:47:53,224 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:47:53,224 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:47:53,224 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:47:53,224 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:47:53,224 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:47:53,225 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:47:53,225 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:47:53,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:47:53,270 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:47:53,274 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:47:53,275 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:47:53,276 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:47:53,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-01-28 22:47:53,444 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:47:53,452 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:47:53,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:47:53,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:47:53,459 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:47:53,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:47:53" (1/1) ... [2018-01-28 22:47:53,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be68e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:53, skipping insertion in model container [2018-01-28 22:47:53,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:47:53" (1/1) ... [2018-01-28 22:47:53,480 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:47:53,522 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:47:53,642 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:47:53,660 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:47:53,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:53 WrapperNode [2018-01-28 22:47:53,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:47:53,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:47:53,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:47:53,698 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:47:53,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:53" (1/1) ... [2018-01-28 22:47:53,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:53" (1/1) ... [2018-01-28 22:47:53,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:53" (1/1) ... [2018-01-28 22:47:53,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:53" (1/1) ... [2018-01-28 22:47:53,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:53" (1/1) ... [2018-01-28 22:47:53,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:53" (1/1) ... [2018-01-28 22:47:53,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:53" (1/1) ... [2018-01-28 22:47:53,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:47:53,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:47:53,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:47:53,732 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:47:53,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:53" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:47:53,781 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:47:53,781 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:47:53,781 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:47:53,781 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 22:47:53,781 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 22:47:53,781 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:47:53,781 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:47:53,782 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:47:53,782 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:47:53,782 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:47:53,782 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:47:53,782 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:47:53,782 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:47:53,782 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-28 22:47:53,782 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:47:53,782 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:47:53,782 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:47:54,266 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:47:54,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:47:54 BoogieIcfgContainer [2018-01-28 22:47:54,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:47:54,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:47:54,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:47:54,271 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:47:54,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:47:53" (1/3) ... [2018-01-28 22:47:54,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84dfb4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:47:54, skipping insertion in model container [2018-01-28 22:47:54,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:47:53" (2/3) ... [2018-01-28 22:47:54,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84dfb4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:47:54, skipping insertion in model container [2018-01-28 22:47:54,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:47:54" (3/3) ... [2018-01-28 22:47:54,275 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-01-28 22:47:54,283 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:47:54,289 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-28 22:47:54,340 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:47:54,340 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:47:54,340 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:47:54,341 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:47:54,341 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:47:54,341 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:47:54,341 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:47:54,341 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:47:54,342 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:47:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2018-01-28 22:47:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-28 22:47:54,371 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:54,372 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:54,372 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:54,378 INFO L82 PathProgramCache]: Analyzing trace with hash -285560507, now seen corresponding path program 1 times [2018-01-28 22:47:54,380 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:54,381 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:54,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:54,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:54,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:54,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:54,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:54,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:47:54,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:47:54,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:47:54,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:47:54,664 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 4 states. [2018-01-28 22:47:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:54,868 INFO L93 Difference]: Finished difference Result 287 states and 325 transitions. [2018-01-28 22:47:54,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:47:54,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-28 22:47:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:54,880 INFO L225 Difference]: With dead ends: 287 [2018-01-28 22:47:54,881 INFO L226 Difference]: Without dead ends: 174 [2018-01-28 22:47:54,884 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:47:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-28 22:47:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 123. [2018-01-28 22:47:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-28 22:47:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-01-28 22:47:54,923 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 9 [2018-01-28 22:47:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:54,924 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-01-28 22:47:54,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:47:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-01-28 22:47:54,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-28 22:47:54,925 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:54,925 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:54,925 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:54,925 INFO L82 PathProgramCache]: Analyzing trace with hash -285560506, now seen corresponding path program 1 times [2018-01-28 22:47:54,925 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:54,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:54,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:54,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:54,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:54,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:54,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:54,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:54,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:47:55,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:47:55,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:47:55,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:47:55,000 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 4 states. [2018-01-28 22:47:55,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:55,178 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2018-01-28 22:47:55,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:47:55,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-28 22:47:55,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:55,181 INFO L225 Difference]: With dead ends: 160 [2018-01-28 22:47:55,181 INFO L226 Difference]: Without dead ends: 158 [2018-01-28 22:47:55,182 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:47:55,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-28 22:47:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2018-01-28 22:47:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-28 22:47:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-01-28 22:47:55,195 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 9 [2018-01-28 22:47:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:55,195 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-01-28 22:47:55,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:47:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-01-28 22:47:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-28 22:47:55,196 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:55,196 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:55,196 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:55,197 INFO L82 PathProgramCache]: Analyzing trace with hash -876101332, now seen corresponding path program 1 times [2018-01-28 22:47:55,197 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:55,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:55,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:55,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:55,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:55,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:55,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:55,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:47:55,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:47:55,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:47:55,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:47:55,285 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 4 states. [2018-01-28 22:47:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:55,436 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2018-01-28 22:47:55,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:47:55,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-28 22:47:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:55,438 INFO L225 Difference]: With dead ends: 143 [2018-01-28 22:47:55,438 INFO L226 Difference]: Without dead ends: 127 [2018-01-28 22:47:55,438 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:47:55,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-28 22:47:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2018-01-28 22:47:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-28 22:47:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2018-01-28 22:47:55,448 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 17 [2018-01-28 22:47:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:55,448 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2018-01-28 22:47:55,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:47:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2018-01-28 22:47:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-28 22:47:55,449 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:55,449 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:55,449 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:55,450 INFO L82 PathProgramCache]: Analyzing trace with hash -876101331, now seen corresponding path program 1 times [2018-01-28 22:47:55,450 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:55,450 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:55,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:55,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:55,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:55,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:55,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:55,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:47:55,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:47:55,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:47:55,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:47:55,551 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 7 states. [2018-01-28 22:47:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:55,893 INFO L93 Difference]: Finished difference Result 219 states and 236 transitions. [2018-01-28 22:47:55,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:47:55,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-01-28 22:47:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:55,895 INFO L225 Difference]: With dead ends: 219 [2018-01-28 22:47:55,895 INFO L226 Difference]: Without dead ends: 206 [2018-01-28 22:47:55,896 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:47:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-28 22:47:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 177. [2018-01-28 22:47:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-28 22:47:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2018-01-28 22:47:55,913 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 17 [2018-01-28 22:47:55,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:55,913 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2018-01-28 22:47:55,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:47:55,914 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2018-01-28 22:47:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-28 22:47:55,914 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:55,914 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:55,915 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:55,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2079112080, now seen corresponding path program 1 times [2018-01-28 22:47:55,915 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:55,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:55,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:55,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:55,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:55,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:55,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:55,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:47:55,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:47:55,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:47:55,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:47:55,962 INFO L87 Difference]: Start difference. First operand 177 states and 201 transitions. Second operand 4 states. [2018-01-28 22:47:56,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:56,091 INFO L93 Difference]: Finished difference Result 197 states and 212 transitions. [2018-01-28 22:47:56,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:47:56,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-28 22:47:56,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:56,093 INFO L225 Difference]: With dead ends: 197 [2018-01-28 22:47:56,093 INFO L226 Difference]: Without dead ends: 196 [2018-01-28 22:47:56,094 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:47:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-28 22:47:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2018-01-28 22:47:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-28 22:47:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2018-01-28 22:47:56,106 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 21 [2018-01-28 22:47:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:56,107 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2018-01-28 22:47:56,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:47:56,107 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2018-01-28 22:47:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-28 22:47:56,108 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:56,108 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:56,108 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2079112081, now seen corresponding path program 1 times [2018-01-28 22:47:56,108 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:56,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:56,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:56,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:56,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:56,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:56,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:56,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:47:56,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:47:56,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:47:56,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:47:56,174 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 4 states. [2018-01-28 22:47:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:56,321 INFO L93 Difference]: Finished difference Result 197 states and 214 transitions. [2018-01-28 22:47:56,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:47:56,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-28 22:47:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:56,323 INFO L225 Difference]: With dead ends: 197 [2018-01-28 22:47:56,323 INFO L226 Difference]: Without dead ends: 195 [2018-01-28 22:47:56,323 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:47:56,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-28 22:47:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 174. [2018-01-28 22:47:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-28 22:47:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 198 transitions. [2018-01-28 22:47:56,333 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 198 transitions. Word has length 21 [2018-01-28 22:47:56,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:56,333 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 198 transitions. [2018-01-28 22:47:56,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:47:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 198 transitions. [2018-01-28 22:47:56,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-28 22:47:56,334 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:56,334 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:56,334 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:56,334 INFO L82 PathProgramCache]: Analyzing trace with hash 845772272, now seen corresponding path program 1 times [2018-01-28 22:47:56,334 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:56,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:56,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:56,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:56,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:56,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:56,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:56,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:47:56,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:47:56,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:47:56,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:47:56,380 INFO L87 Difference]: Start difference. First operand 174 states and 198 transitions. Second operand 6 states. [2018-01-28 22:47:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:56,626 INFO L93 Difference]: Finished difference Result 305 states and 348 transitions. [2018-01-28 22:47:56,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:47:56,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-28 22:47:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:56,629 INFO L225 Difference]: With dead ends: 305 [2018-01-28 22:47:56,629 INFO L226 Difference]: Without dead ends: 304 [2018-01-28 22:47:56,630 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:47:56,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-01-28 22:47:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 173. [2018-01-28 22:47:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-28 22:47:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 197 transitions. [2018-01-28 22:47:56,638 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 197 transitions. Word has length 21 [2018-01-28 22:47:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:56,639 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 197 transitions. [2018-01-28 22:47:56,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:47:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 197 transitions. [2018-01-28 22:47:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-28 22:47:56,639 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:56,639 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:56,640 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash 845772273, now seen corresponding path program 1 times [2018-01-28 22:47:56,640 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:56,640 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:56,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:56,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:56,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:56,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:56,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:56,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:47:56,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:47:56,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:47:56,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:47:56,722 INFO L87 Difference]: Start difference. First operand 173 states and 197 transitions. Second operand 6 states. [2018-01-28 22:47:57,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:57,090 INFO L93 Difference]: Finished difference Result 314 states and 360 transitions. [2018-01-28 22:47:57,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:47:57,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-28 22:47:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:57,092 INFO L225 Difference]: With dead ends: 314 [2018-01-28 22:47:57,092 INFO L226 Difference]: Without dead ends: 310 [2018-01-28 22:47:57,093 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:47:57,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-01-28 22:47:57,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 162. [2018-01-28 22:47:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-28 22:47:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 185 transitions. [2018-01-28 22:47:57,106 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 185 transitions. Word has length 21 [2018-01-28 22:47:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:57,107 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 185 transitions. [2018-01-28 22:47:57,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:47:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 185 transitions. [2018-01-28 22:47:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-28 22:47:57,107 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:57,108 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:57,108 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:57,108 INFO L82 PathProgramCache]: Analyzing trace with hash 682585211, now seen corresponding path program 1 times [2018-01-28 22:47:57,108 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:57,108 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:57,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:57,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:57,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:57,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:57,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:57,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:47:57,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:47:57,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:47:57,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:47:57,184 INFO L87 Difference]: Start difference. First operand 162 states and 185 transitions. Second operand 5 states. [2018-01-28 22:47:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:57,379 INFO L93 Difference]: Finished difference Result 204 states and 217 transitions. [2018-01-28 22:47:57,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:47:57,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-28 22:47:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:57,380 INFO L225 Difference]: With dead ends: 204 [2018-01-28 22:47:57,380 INFO L226 Difference]: Without dead ends: 199 [2018-01-28 22:47:57,381 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:47:57,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-28 22:47:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 132. [2018-01-28 22:47:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-28 22:47:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-01-28 22:47:57,389 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 26 [2018-01-28 22:47:57,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:57,389 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-01-28 22:47:57,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:47:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-01-28 22:47:57,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 22:47:57,390 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:57,390 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:57,390 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:57,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1858449896, now seen corresponding path program 1 times [2018-01-28 22:47:57,391 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:57,391 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:57,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:57,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:57,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:57,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:57,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:47:57,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:47:57,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:47:57,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:47:57,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:47:57,499 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 5 states. [2018-01-28 22:47:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:57,679 INFO L93 Difference]: Finished difference Result 251 states and 271 transitions. [2018-01-28 22:47:57,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:47:57,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-28 22:47:57,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:57,681 INFO L225 Difference]: With dead ends: 251 [2018-01-28 22:47:57,681 INFO L226 Difference]: Without dead ends: 156 [2018-01-28 22:47:57,681 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:47:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-28 22:47:57,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2018-01-28 22:47:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-28 22:47:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2018-01-28 22:47:57,688 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 31 [2018-01-28 22:47:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:57,688 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2018-01-28 22:47:57,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:47:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2018-01-28 22:47:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 22:47:57,690 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:57,690 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:57,690 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:57,690 INFO L82 PathProgramCache]: Analyzing trace with hash 125549571, now seen corresponding path program 1 times [2018-01-28 22:47:57,691 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:57,691 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:57,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:57,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:57,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:57,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:57,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:47:57,918 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:47:57,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:57,964 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:47:58,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:47:58,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:58,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:58,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 22:47:58,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:47:58,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:47:58,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:58,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:58,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:58,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-28 22:47:58,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-28 22:47:58,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-28 22:47:58,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:58,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:58,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:47:58,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-01-28 22:47:58,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:58,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:47:58,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-01-28 22:47:58,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:47:58,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:47:58,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:47:58,242 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand 13 states. [2018-01-28 22:47:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:47:58,773 INFO L93 Difference]: Finished difference Result 198 states and 212 transitions. [2018-01-28 22:47:58,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:47:58,787 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-28 22:47:58,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:47:58,789 INFO L225 Difference]: With dead ends: 198 [2018-01-28 22:47:58,789 INFO L226 Difference]: Without dead ends: 196 [2018-01-28 22:47:58,789 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2018-01-28 22:47:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-28 22:47:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 152. [2018-01-28 22:47:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-28 22:47:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2018-01-28 22:47:58,802 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 33 [2018-01-28 22:47:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:47:58,803 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2018-01-28 22:47:58,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:47:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2018-01-28 22:47:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 22:47:58,804 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:47:58,804 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:47:58,804 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:47:58,805 INFO L82 PathProgramCache]: Analyzing trace with hash 125549572, now seen corresponding path program 1 times [2018-01-28 22:47:58,805 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:47:58,805 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:47:58,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:58,806 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:58,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:47:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:58,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:47:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:59,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:47:59,030 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:47:59,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:47:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:47:59,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:47:59,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 22:47:59,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:59,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:59,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:47:59,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-01-28 22:47:59,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:59,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:59,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-01-28 22:47:59,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:47:59,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:47:59,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:59,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:59,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:47:59,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:47:59,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:59,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:59,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:59,258 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2018-01-28 22:47:59,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-28 22:47:59,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-28 22:47:59,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:59,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:59,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-28 22:47:59,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-28 22:47:59,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:47:59,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:47:59,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:47:59,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:19 [2018-01-28 22:47:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:47:59,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:47:59,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2018-01-28 22:47:59,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 22:47:59,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 22:47:59,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:47:59,429 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand 17 states. [2018-01-28 22:48:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:00,455 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-01-28 22:48:00,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 22:48:00,456 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2018-01-28 22:48:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:00,457 INFO L225 Difference]: With dead ends: 229 [2018-01-28 22:48:00,457 INFO L226 Difference]: Without dead ends: 226 [2018-01-28 22:48:00,457 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:48:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-28 22:48:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 150. [2018-01-28 22:48:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-28 22:48:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2018-01-28 22:48:00,470 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 33 [2018-01-28 22:48:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:00,471 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2018-01-28 22:48:00,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 22:48:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2018-01-28 22:48:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:48:00,472 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:00,472 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:00,472 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:48:00,472 INFO L82 PathProgramCache]: Analyzing trace with hash 532749667, now seen corresponding path program 1 times [2018-01-28 22:48:00,473 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:00,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:00,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:00,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:00,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:00,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:00,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:48:00,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:48:00,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:48:00,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:48:00,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:48:00,579 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand 9 states. [2018-01-28 22:48:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:00,800 INFO L93 Difference]: Finished difference Result 207 states and 223 transitions. [2018-01-28 22:48:00,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:48:00,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-28 22:48:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:00,802 INFO L225 Difference]: With dead ends: 207 [2018-01-28 22:48:00,802 INFO L226 Difference]: Without dead ends: 206 [2018-01-28 22:48:00,802 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:48:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-28 22:48:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 157. [2018-01-28 22:48:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-28 22:48:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 172 transitions. [2018-01-28 22:48:00,814 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 172 transitions. Word has length 34 [2018-01-28 22:48:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:00,815 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 172 transitions. [2018-01-28 22:48:00,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:48:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2018-01-28 22:48:00,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:48:00,815 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:00,815 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:00,815 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:48:00,815 INFO L82 PathProgramCache]: Analyzing trace with hash 532749668, now seen corresponding path program 1 times [2018-01-28 22:48:00,816 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:00,816 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:00,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:00,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:00,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:00,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:00,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:48:00,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:48:00,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:48:00,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:48:00,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:48:00,971 INFO L87 Difference]: Start difference. First operand 157 states and 172 transitions. Second operand 8 states. [2018-01-28 22:48:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:01,403 INFO L93 Difference]: Finished difference Result 235 states and 251 transitions. [2018-01-28 22:48:01,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:48:01,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-28 22:48:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:01,405 INFO L225 Difference]: With dead ends: 235 [2018-01-28 22:48:01,405 INFO L226 Difference]: Without dead ends: 233 [2018-01-28 22:48:01,405 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:48:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-28 22:48:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 160. [2018-01-28 22:48:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-28 22:48:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2018-01-28 22:48:01,419 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 34 [2018-01-28 22:48:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:01,419 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2018-01-28 22:48:01,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:48:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2018-01-28 22:48:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 22:48:01,420 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:01,420 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:01,420 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:48:01,420 INFO L82 PathProgramCache]: Analyzing trace with hash -195766224, now seen corresponding path program 1 times [2018-01-28 22:48:01,420 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:01,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:01,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:01,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:01,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:01,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:01,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:48:01,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:48:01,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:48:01,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:48:01,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:48:01,480 INFO L87 Difference]: Start difference. First operand 160 states and 174 transitions. Second operand 5 states. [2018-01-28 22:48:01,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:01,608 INFO L93 Difference]: Finished difference Result 223 states and 240 transitions. [2018-01-28 22:48:01,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:48:01,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-28 22:48:01,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:01,609 INFO L225 Difference]: With dead ends: 223 [2018-01-28 22:48:01,609 INFO L226 Difference]: Without dead ends: 220 [2018-01-28 22:48:01,610 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:48:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-28 22:48:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 189. [2018-01-28 22:48:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-28 22:48:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2018-01-28 22:48:01,621 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 38 [2018-01-28 22:48:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:01,621 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2018-01-28 22:48:01,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:48:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2018-01-28 22:48:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 22:48:01,622 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:01,622 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:01,623 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:48:01,623 INFO L82 PathProgramCache]: Analyzing trace with hash -151858574, now seen corresponding path program 1 times [2018-01-28 22:48:01,623 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:01,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:01,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:01,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:01,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:01,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:01,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:48:01,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:48:01,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:48:01,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:48:01,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:48:01,763 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand 9 states. [2018-01-28 22:48:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:02,018 INFO L93 Difference]: Finished difference Result 300 states and 321 transitions. [2018-01-28 22:48:02,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:48:02,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-01-28 22:48:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:02,019 INFO L225 Difference]: With dead ends: 300 [2018-01-28 22:48:02,019 INFO L226 Difference]: Without dead ends: 251 [2018-01-28 22:48:02,020 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:48:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-01-28 22:48:02,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 193. [2018-01-28 22:48:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-28 22:48:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2018-01-28 22:48:02,038 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 40 [2018-01-28 22:48:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:02,038 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2018-01-28 22:48:02,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:48:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2018-01-28 22:48:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 22:48:02,039 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:02,040 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:02,040 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:48:02,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1065979994, now seen corresponding path program 2 times [2018-01-28 22:48:02,040 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:02,040 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:02,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:02,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:02,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:02,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-28 22:48:02,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:48:02,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 22:48:02,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:48:02,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:48:02,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:48:02,211 INFO L87 Difference]: Start difference. First operand 193 states and 217 transitions. Second operand 11 states. [2018-01-28 22:48:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:02,636 INFO L93 Difference]: Finished difference Result 254 states and 272 transitions. [2018-01-28 22:48:02,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:48:02,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-01-28 22:48:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:02,638 INFO L225 Difference]: With dead ends: 254 [2018-01-28 22:48:02,638 INFO L226 Difference]: Without dead ends: 196 [2018-01-28 22:48:02,639 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2018-01-28 22:48:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-28 22:48:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2018-01-28 22:48:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-28 22:48:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2018-01-28 22:48:02,655 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 40 [2018-01-28 22:48:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:02,655 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2018-01-28 22:48:02,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:48:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2018-01-28 22:48:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 22:48:02,656 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:02,656 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:02,656 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:48:02,656 INFO L82 PathProgramCache]: Analyzing trace with hash 523031764, now seen corresponding path program 1 times [2018-01-28 22:48:02,656 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:02,656 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:02,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:02,657 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:48:02,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:02,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:02,797 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:48:02,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 22:48:02,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:48:02,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:48:02,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:48:02,798 INFO L87 Difference]: Start difference. First operand 171 states and 188 transitions. Second operand 11 states. [2018-01-28 22:48:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:03,278 INFO L93 Difference]: Finished difference Result 252 states and 271 transitions. [2018-01-28 22:48:03,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:48:03,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-01-28 22:48:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:03,281 INFO L225 Difference]: With dead ends: 252 [2018-01-28 22:48:03,281 INFO L226 Difference]: Without dead ends: 220 [2018-01-28 22:48:03,282 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-01-28 22:48:03,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-28 22:48:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 188. [2018-01-28 22:48:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-28 22:48:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 205 transitions. [2018-01-28 22:48:03,305 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 205 transitions. Word has length 41 [2018-01-28 22:48:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:03,305 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 205 transitions. [2018-01-28 22:48:03,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:48:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 205 transitions. [2018-01-28 22:48:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 22:48:03,306 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:03,306 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:03,306 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:48:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1922817663, now seen corresponding path program 1 times [2018-01-28 22:48:03,306 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:03,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:03,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:03,307 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:03,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:03,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:03,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:48:03,598 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:48:03,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:03,636 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:48:03,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:48:03,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:48:03,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:48:03,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:48:03,698 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,708 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-01-28 22:48:03,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-28 22:48:03,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:03,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:48:03,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-28 22:48:03,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:03,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-28 22:48:03,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2018-01-28 22:48:03,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:03,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:03,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:48:03,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-01-28 22:48:03,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-01-28 22:48:03,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-28 22:48:03,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-01-28 22:48:03,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-28 22:48:03,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,938 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:22 [2018-01-28 22:48:03,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-28 22:48:03,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:48:03,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-01-28 22:48:03,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:48:03,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:03,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:38 [2018-01-28 22:48:04,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-01-28 22:48:04,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-01-28 22:48:04,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:04,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-01-28 22:48:04,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:48:04,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:48:04,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-28 22:48:04,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-28 22:48:04,241 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:04,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-01-28 22:48:04,262 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:04,267 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:04,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:04,272 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2018-01-28 22:48:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:04,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:48:04,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-01-28 22:48:04,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-28 22:48:04,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-28 22:48:04,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=318, Unknown=15, NotChecked=0, Total=380 [2018-01-28 22:48:04,352 INFO L87 Difference]: Start difference. First operand 188 states and 205 transitions. Second operand 20 states. [2018-01-28 22:48:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:05,456 INFO L93 Difference]: Finished difference Result 272 states and 289 transitions. [2018-01-28 22:48:05,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-28 22:48:05,456 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-01-28 22:48:05,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:05,457 INFO L225 Difference]: With dead ends: 272 [2018-01-28 22:48:05,457 INFO L226 Difference]: Without dead ends: 240 [2018-01-28 22:48:05,458 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=1312, Unknown=18, NotChecked=0, Total=1560 [2018-01-28 22:48:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-28 22:48:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 212. [2018-01-28 22:48:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-28 22:48:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 230 transitions. [2018-01-28 22:48:05,474 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 230 transitions. Word has length 42 [2018-01-28 22:48:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:05,474 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 230 transitions. [2018-01-28 22:48:05,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-28 22:48:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 230 transitions. [2018-01-28 22:48:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 22:48:05,475 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:05,475 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:05,475 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:48:05,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1282423572, now seen corresponding path program 1 times [2018-01-28 22:48:05,475 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:05,476 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:05,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:05,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:05,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:05,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:05,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:48:05,628 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:48:05,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:05,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:48:05,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:05,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:05,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-28 22:48:05,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:05,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:05,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-28 22:48:05,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:48:05,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:48:05,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:05,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:05,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:05,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-01-28 22:48:05,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:05,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-28 22:48:05,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-28 22:48:05,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:05,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:05,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:05,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:26 [2018-01-28 22:48:05,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-01-28 22:48:05,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:48:05,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:05,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:05,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:48:05,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-01-28 22:48:05,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-01-28 22:48:05,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-28 22:48:05,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:06,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-28 22:48:06,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:06,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:06,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:48:06,014 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-01-28 22:48:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:06,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:48:06,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-28 22:48:06,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:48:06,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:48:06,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-01-28 22:48:06,077 INFO L87 Difference]: Start difference. First operand 212 states and 230 transitions. Second operand 21 states. [2018-01-28 22:48:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:07,005 INFO L93 Difference]: Finished difference Result 310 states and 330 transitions. [2018-01-28 22:48:07,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 22:48:07,005 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-01-28 22:48:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:07,006 INFO L225 Difference]: With dead ends: 310 [2018-01-28 22:48:07,006 INFO L226 Difference]: Without dead ends: 309 [2018-01-28 22:48:07,007 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=1167, Unknown=0, NotChecked=0, Total=1482 [2018-01-28 22:48:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-28 22:48:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 240. [2018-01-28 22:48:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-28 22:48:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 263 transitions. [2018-01-28 22:48:07,028 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 263 transitions. Word has length 42 [2018-01-28 22:48:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:07,028 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 263 transitions. [2018-01-28 22:48:07,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:48:07,029 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 263 transitions. [2018-01-28 22:48:07,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 22:48:07,029 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:07,029 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:07,030 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:48:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1282423573, now seen corresponding path program 1 times [2018-01-28 22:48:07,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:07,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:07,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:07,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:07,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:07,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:07,214 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:48:07,214 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:48:07,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:07,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:48:07,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 22:48:07,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:07,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:07,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:48:07,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-01-28 22:48:07,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:48:07,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:48:07,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:48:07,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:48:07,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-01-28 22:48:07,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:07,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-01-28 22:48:07,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-28 22:48:07,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:48:07,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-28 22:48:07,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-01-28 22:48:07,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,365 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:28 [2018-01-28 22:48:07,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-01-28 22:48:07,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:48:07,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-01-28 22:48:07,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:48:07,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:48:07,430 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-01-28 22:48:07,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-01-28 22:48:07,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-28 22:48:07,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-01-28 22:48:07,494 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-28 22:48:07,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-28 22:48:07,507 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 22:48:07,512 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,513 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:07,516 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-01-28 22:48:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:07,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:48:07,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-01-28 22:48:07,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-28 22:48:07,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-28 22:48:07,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-01-28 22:48:07,552 INFO L87 Difference]: Start difference. First operand 240 states and 263 transitions. Second operand 18 states. [2018-01-28 22:48:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:08,382 INFO L93 Difference]: Finished difference Result 322 states and 344 transitions. [2018-01-28 22:48:08,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:48:08,382 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2018-01-28 22:48:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:08,383 INFO L225 Difference]: With dead ends: 322 [2018-01-28 22:48:08,383 INFO L226 Difference]: Without dead ends: 316 [2018-01-28 22:48:08,384 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2018-01-28 22:48:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-01-28 22:48:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 253. [2018-01-28 22:48:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-01-28 22:48:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 277 transitions. [2018-01-28 22:48:08,405 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 277 transitions. Word has length 42 [2018-01-28 22:48:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:08,405 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 277 transitions. [2018-01-28 22:48:08,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-28 22:48:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 277 transitions. [2018-01-28 22:48:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:48:08,406 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:08,406 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:08,407 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:48:08,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1598385953, now seen corresponding path program 1 times [2018-01-28 22:48:08,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:08,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:08,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:08,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:08,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:08,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:08,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:48:08,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:48:08,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:48:08,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:48:08,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:48:08,449 INFO L87 Difference]: Start difference. First operand 253 states and 277 transitions. Second operand 5 states. [2018-01-28 22:48:08,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:08,563 INFO L93 Difference]: Finished difference Result 275 states and 295 transitions. [2018-01-28 22:48:08,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:48:08,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-01-28 22:48:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:08,566 INFO L225 Difference]: With dead ends: 275 [2018-01-28 22:48:08,566 INFO L226 Difference]: Without dead ends: 272 [2018-01-28 22:48:08,566 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:48:08,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-01-28 22:48:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 240. [2018-01-28 22:48:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-28 22:48:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 259 transitions. [2018-01-28 22:48:08,578 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 259 transitions. Word has length 45 [2018-01-28 22:48:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:08,578 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 259 transitions. [2018-01-28 22:48:08,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:48:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 259 transitions. [2018-01-28 22:48:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:48:08,578 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:08,578 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:08,578 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:48:08,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2122700765, now seen corresponding path program 1 times [2018-01-28 22:48:08,579 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:08,579 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:08,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:08,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:08,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:08,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-28 22:48:08,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:48:08,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:48:08,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:48:08,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:48:08,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:48:08,663 INFO L87 Difference]: Start difference. First operand 240 states and 259 transitions. Second operand 8 states. [2018-01-28 22:48:08,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:08,866 INFO L93 Difference]: Finished difference Result 300 states and 320 transitions. [2018-01-28 22:48:08,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:48:08,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-28 22:48:08,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:08,900 INFO L225 Difference]: With dead ends: 300 [2018-01-28 22:48:08,900 INFO L226 Difference]: Without dead ends: 279 [2018-01-28 22:48:08,900 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:48:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-01-28 22:48:08,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 240. [2018-01-28 22:48:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-28 22:48:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 257 transitions. [2018-01-28 22:48:08,919 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 257 transitions. Word has length 45 [2018-01-28 22:48:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:08,919 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 257 transitions. [2018-01-28 22:48:08,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:48:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 257 transitions. [2018-01-28 22:48:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-28 22:48:08,920 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:08,920 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:08,921 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:48:08,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1596211252, now seen corresponding path program 1 times [2018-01-28 22:48:08,921 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:08,921 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:08,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:08,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:08,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:08,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:48:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:09,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:48:09,019 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:48:09,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:48:09,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:48:09,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-28 22:48:09,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-01-28 22:48:09,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:09,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:09,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-28 22:48:09,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 22:48:09,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:09,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:09,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:09,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-01-28 22:48:09,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:48:09,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:48:09,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:09,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:09,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:48:09,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:48:09,175 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:48:09,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:09,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:48:09,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-01-28 22:48:09,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-28 22:48:09,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:48:09,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 22:48:09,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:48:09,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-28 22:48:09,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:48:09,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-28 22:48:09,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:48:09,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:48:09,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:18 [2018-01-28 22:48:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:48:09,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:48:09,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 21 [2018-01-28 22:48:09,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:48:09,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:48:09,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-01-28 22:48:09,357 INFO L87 Difference]: Start difference. First operand 240 states and 257 transitions. Second operand 21 states. [2018-01-28 22:48:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:48:10,314 INFO L93 Difference]: Finished difference Result 304 states and 323 transitions. [2018-01-28 22:48:10,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-28 22:48:10,314 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-01-28 22:48:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:48:10,315 INFO L225 Difference]: With dead ends: 304 [2018-01-28 22:48:10,315 INFO L226 Difference]: Without dead ends: 291 [2018-01-28 22:48:10,316 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=347, Invalid=1723, Unknown=0, NotChecked=0, Total=2070 [2018-01-28 22:48:10,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-28 22:48:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 256. [2018-01-28 22:48:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-01-28 22:48:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 274 transitions. [2018-01-28 22:48:10,333 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 274 transitions. Word has length 52 [2018-01-28 22:48:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:48:10,333 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 274 transitions. [2018-01-28 22:48:10,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:48:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 274 transitions. [2018-01-28 22:48:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-28 22:48:10,334 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:48:10,334 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:48:10,334 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 22:48:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1596212790, now seen corresponding path program 1 times [2018-01-28 22:48:10,334 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:48:10,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:48:10,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:10,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:48:10,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:48:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 22:48:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 22:48:10,392 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 22:48:10,421 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-28 22:48:10,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:48:10 BoogieIcfgContainer [2018-01-28 22:48:10,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:48:10,445 INFO L168 Benchmark]: Toolchain (without parser) took 17000.25 ms. Allocated memory was 306.2 MB in the beginning and 644.3 MB in the end (delta: 338.2 MB). Free memory was 266.2 MB in the beginning and 466.3 MB in the end (delta: -200.0 MB). Peak memory consumption was 138.1 MB. Max. memory is 5.3 GB. [2018-01-28 22:48:10,447 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:48:10,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.31 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 253.0 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-28 22:48:10,447 INFO L168 Benchmark]: Boogie Preprocessor took 33.72 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:48:10,448 INFO L168 Benchmark]: RCFGBuilder took 535.33 ms. Allocated memory is still 306.2 MB. Free memory was 251.0 MB in the beginning and 218.3 MB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 5.3 GB. [2018-01-28 22:48:10,448 INFO L168 Benchmark]: TraceAbstraction took 16176.75 ms. Allocated memory was 306.2 MB in the beginning and 644.3 MB in the end (delta: 338.2 MB). Free memory was 218.3 MB in the beginning and 466.3 MB in the end (delta: -247.9 MB). Peak memory consumption was 90.3 MB. Max. memory is 5.3 GB. [2018-01-28 22:48:10,449 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.16 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 244.31 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 253.0 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.72 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 535.33 ms. Allocated memory is still 306.2 MB. Free memory was 251.0 MB in the beginning and 218.3 MB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 16176.75 ms. Allocated memory was 306.2 MB in the beginning and 644.3 MB in the end (delta: 338.2 MB). Free memory was 218.3 MB in the beginning and 466.3 MB in the end (delta: -247.9 MB). Peak memory consumption was 90.3 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.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L988] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={12:0}] [L988] SLL* head = malloc(sizeof(SLL)); VAL [head={12:0}, malloc(sizeof(SLL))={12:0}] [L989] FCALL head->next = ((void*)0) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}] [L990] FCALL head->data = 0 VAL [head={12:0}, malloc(sizeof(SLL))={12:0}] [L992] SLL* x = head; VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}] [L1014] x = head VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}] [L1015] FCALL x->next VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, x->next={0:0}] [L1015] COND FALSE !(x->next) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, x->next={0:0}] [L1022] EXPR, FCALL x->next VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, x->next={0:0}] [L1022] SLL* y = x->next; VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, x={12:0}, x->next={0:0}, y={0:0}] [L1023] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={12:0}, y={0:0}] [L1023] FCALL x->next = malloc(sizeof(SLL)) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={12:0}, y={0:0}] [L1024] FCALL x->data = 1 VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={12:0}, y={0:0}] [L1025] FCALL x->next = y VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={12:0}, y={0:0}] [L1029] x = head VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={12:0}, y={0:0}] [L1032] EXPR, FCALL x->data VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={12:0}, x->data=1, y={0:0}] [L1032] COND FALSE !(x->data != 1) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={12:0}, x->data=1, y={0:0}] [L1038] EXPR, FCALL x->next VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={12:0}, x->next={0:0}, y={0:0}] [L1038] x = x->next VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, x->next={0:0}, y={0:0}] [L1039] COND FALSE !(\read(*x)) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1047] x = head VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={12:0}, y={0:0}] [L1048] COND TRUE x != ((void*)0) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={12:0}, y={0:0}] [L1050] head = x VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={12:0}, y={0:0}] [L1051] EXPR, FCALL x->next VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={12:0}, x->next={0:0}, y={0:0}] [L1051] x = x->next VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, x->next={0:0}, y={0:0}] [L1052] FCALL free(head) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1048] COND FALSE !(x != ((void*)0)) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1055] return 0; VAL [\result=0, head={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 43 error locations. UNSAFE Result, 16.1s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 9.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2307 SDtfs, 7364 SDslu, 8604 SDs, 0 SdLazy, 8469 SolverSat, 890 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 613 GetRequests, 230 SyntacticMatches, 31 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1561 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 1178 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1050 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 968 ConstructedInterpolants, 44 QuantifiedInterpolants, 329962 SizeOfPredicates, 95 NumberOfNonLiveVariables, 907 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 25/61 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 /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-48-10-457.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-48-10-457.csv Received shutdown request...