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/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:06:56,529 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:06:56,530 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:06:56,542 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:06:56,543 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:06:56,544 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:06:56,545 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:06:56,547 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:06:56,549 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:06:56,549 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:06:56,550 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:06:56,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:06:56,551 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:06:56,552 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:06:56,552 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:06:56,555 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:06:56,557 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:06:56,559 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:06:56,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:06:56,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:06:56,564 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:06:56,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:06:56,564 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:06:56,565 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:06:56,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:06:56,567 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:06:56,567 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:06:56,568 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:06:56,568 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:06:56,568 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:06:56,569 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:06:56,569 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:06:56,579 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:06:56,579 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:06:56,580 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:06:56,580 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:06:56,581 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:06:56,581 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:06:56,581 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:06:56,582 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:06:56,582 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:06:56,582 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:06:56,582 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:06:56,582 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:06:56,583 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:06:56,583 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:06:56,583 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:06:56,583 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:06:56,583 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:06:56,584 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:06:56,584 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:06:56,584 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:06:56,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:06:56,585 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:06:56,585 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:06:56,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:06:56,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:06:56,585 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:06:56,586 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:06:56,586 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:06:56,586 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:06:56,586 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:06:56,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:06:56,587 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:06:56,587 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:06:56,588 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:06:56,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:06:56,636 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:06:56,640 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:06:56,642 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:06:56,642 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:06:56,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-01-28 22:06:56,818 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:06:56,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:06:56,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:06:56,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:06:56,828 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:06:56,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:06:56" (1/1) ... [2018-01-28 22:06:56,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75200bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:06:56, skipping insertion in model container [2018-01-28 22:06:56,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:06:56" (1/1) ... [2018-01-28 22:06:56,849 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:06:56,889 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:06:57,004 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:06:57,020 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:06:57,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:06:57 WrapperNode [2018-01-28 22:06:57,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:06:57,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:06:57,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:06:57,028 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:06:57,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:06:57" (1/1) ... [2018-01-28 22:06:57,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:06:57" (1/1) ... [2018-01-28 22:06:57,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:06:57" (1/1) ... [2018-01-28 22:06:57,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:06:57" (1/1) ... [2018-01-28 22:06:57,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:06:57" (1/1) ... [2018-01-28 22:06:57,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:06:57" (1/1) ... [2018-01-28 22:06:57,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:06:57" (1/1) ... [2018-01-28 22:06:57,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:06:57,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:06:57,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:06:57,063 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:06:57,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:06:57" (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:06:57,108 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:06:57,109 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:06:57,109 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-28 22:06:57,109 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:06:57,109 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:06:57,109 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:06:57,109 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:06:57,109 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:06:57,109 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:06:57,109 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:06:57,110 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:06:57,110 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:06:57,110 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-28 22:06:57,110 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:06:57,110 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:06:57,110 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:06:57,532 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:06:57,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:06:57 BoogieIcfgContainer [2018-01-28 22:06:57,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:06:57,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:06:57,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:06:57,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:06:57,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:06:56" (1/3) ... [2018-01-28 22:06:57,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415bdf4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:06:57, skipping insertion in model container [2018-01-28 22:06:57,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:06:57" (2/3) ... [2018-01-28 22:06:57,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415bdf4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:06:57, skipping insertion in model container [2018-01-28 22:06:57,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:06:57" (3/3) ... [2018-01-28 22:06:57,540 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-01-28 22:06:57,546 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:06:57,553 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-28 22:06:57,592 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:06:57,592 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:06:57,592 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:06:57,592 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:06:57,592 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:06:57,592 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:06:57,592 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:06:57,592 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:06:57,593 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:06:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-01-28 22:06:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-28 22:06:57,615 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:06:57,616 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:06:57,616 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:06:57,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1354053822, now seen corresponding path program 1 times [2018-01-28 22:06:57,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:06:57,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:06:57,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:57,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:06:57,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:06:57,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:06:57,759 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:06:57,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:06:57,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:06:57,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:06:57,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:06:57,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:06:57,775 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2018-01-28 22:06:58,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:06:58,006 INFO L93 Difference]: Finished difference Result 199 states and 215 transitions. [2018-01-28 22:06:58,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:06:58,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-01-28 22:06:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:06:58,017 INFO L225 Difference]: With dead ends: 199 [2018-01-28 22:06:58,017 INFO L226 Difference]: Without dead ends: 128 [2018-01-28 22:06:58,020 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:06:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-28 22:06:58,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2018-01-28 22:06:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-28 22:06:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-01-28 22:06:58,057 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 9 [2018-01-28 22:06:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:06:58,057 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-01-28 22:06:58,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:06:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-01-28 22:06:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-28 22:06:58,058 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:06:58,058 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:06:58,058 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:06:58,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1354053821, now seen corresponding path program 1 times [2018-01-28 22:06:58,058 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:06:58,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:06:58,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:58,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:06:58,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:06:58,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:06:58,140 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:06:58,140 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:06:58,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:06:58,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:06:58,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:06:58,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:06:58,143 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 3 states. [2018-01-28 22:06:58,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:06:58,258 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2018-01-28 22:06:58,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:06:58,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-01-28 22:06:58,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:06:58,261 INFO L225 Difference]: With dead ends: 125 [2018-01-28 22:06:58,261 INFO L226 Difference]: Without dead ends: 124 [2018-01-28 22:06:58,262 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:06:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-28 22:06:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-01-28 22:06:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-28 22:06:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2018-01-28 22:06:58,271 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 9 [2018-01-28 22:06:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:06:58,272 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2018-01-28 22:06:58,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:06:58,272 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-01-28 22:06:58,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 22:06:58,272 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:06:58,272 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:06:58,272 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:06:58,273 INFO L82 PathProgramCache]: Analyzing trace with hash -500644389, now seen corresponding path program 1 times [2018-01-28 22:06:58,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:06:58,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:06:58,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:58,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:06:58,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:06:58,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:06:58,372 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:06:58,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:06:58,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:06:58,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:06:58,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:06:58,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:06:58,373 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 5 states. [2018-01-28 22:06:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:06:58,617 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-01-28 22:06:58,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:06:58,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-28 22:06:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:06:58,619 INFO L225 Difference]: With dead ends: 125 [2018-01-28 22:06:58,619 INFO L226 Difference]: Without dead ends: 120 [2018-01-28 22:06:58,620 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:06:58,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-28 22:06:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2018-01-28 22:06:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-28 22:06:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-01-28 22:06:58,630 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 19 [2018-01-28 22:06:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:06:58,631 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-01-28 22:06:58,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:06:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-01-28 22:06:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 22:06:58,631 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:06:58,632 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:06:58,632 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:06:58,632 INFO L82 PathProgramCache]: Analyzing trace with hash -500644388, now seen corresponding path program 1 times [2018-01-28 22:06:58,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:06:58,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:06:58,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:58,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:06:58,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:06:58,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:06:58,739 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:06:58,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:06:58,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:06:58,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:06:58,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:06:58,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:06:58,741 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 7 states. [2018-01-28 22:06:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:06:58,897 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-01-28 22:06:58,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:06:58,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-28 22:06:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:06:58,898 INFO L225 Difference]: With dead ends: 116 [2018-01-28 22:06:58,898 INFO L226 Difference]: Without dead ends: 107 [2018-01-28 22:06:58,898 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:06:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-28 22:06:58,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-01-28 22:06:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-28 22:06:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-01-28 22:06:58,906 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 19 [2018-01-28 22:06:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:06:58,906 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-01-28 22:06:58,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:06:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-01-28 22:06:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 22:06:58,907 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:06:58,907 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] [2018-01-28 22:06:58,907 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:06:58,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1659893220, now seen corresponding path program 1 times [2018-01-28 22:06:58,907 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:06:58,907 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:06:58,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:58,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:06:58,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:06:58,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:06:58,955 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:06:58,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:06:58,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:06:58,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:06:58,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:06:58,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:06:58,957 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 4 states. [2018-01-28 22:06:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:06:59,053 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-01-28 22:06:59,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:06:59,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-28 22:06:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:06:59,054 INFO L225 Difference]: With dead ends: 107 [2018-01-28 22:06:59,054 INFO L226 Difference]: Without dead ends: 103 [2018-01-28 22:06:59,055 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:06:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-28 22:06:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-01-28 22:06:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-28 22:06:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-01-28 22:06:59,063 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 20 [2018-01-28 22:06:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:06:59,063 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-01-28 22:06:59,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:06:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-01-28 22:06:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 22:06:59,064 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:06:59,064 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] [2018-01-28 22:06:59,064 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:06:59,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1659893221, now seen corresponding path program 1 times [2018-01-28 22:06:59,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:06:59,065 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:06:59,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:59,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:06:59,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:06:59,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:06:59,114 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:06:59,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:06:59,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:06:59,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:06:59,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:06:59,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:06:59,115 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 4 states. [2018-01-28 22:06:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:06:59,164 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-01-28 22:06:59,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:06:59,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-28 22:06:59,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:06:59,166 INFO L225 Difference]: With dead ends: 103 [2018-01-28 22:06:59,166 INFO L226 Difference]: Without dead ends: 99 [2018-01-28 22:06:59,166 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:06:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-28 22:06:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-28 22:06:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-28 22:06:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-01-28 22:06:59,171 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 20 [2018-01-28 22:06:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:06:59,172 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-01-28 22:06:59,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:06:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-01-28 22:06:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:06:59,173 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:06:59,173 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] [2018-01-28 22:06:59,173 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:06:59,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1201296314, now seen corresponding path program 1 times [2018-01-28 22:06:59,174 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:06:59,174 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:06:59,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:59,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:06:59,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:06:59,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:06:59,271 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:06:59,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:06:59,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:06:59,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:06:59,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:06:59,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:06:59,273 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 8 states. [2018-01-28 22:06:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:06:59,499 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions. [2018-01-28 22:06:59,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:06:59,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-28 22:06:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:06:59,502 INFO L225 Difference]: With dead ends: 209 [2018-01-28 22:06:59,502 INFO L226 Difference]: Without dead ends: 120 [2018-01-28 22:06:59,503 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:06:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-28 22:06:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2018-01-28 22:06:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-28 22:06:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-28 22:06:59,512 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 25 [2018-01-28 22:06:59,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:06:59,512 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-28 22:06:59,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:06:59,513 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-28 22:06:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:06:59,515 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:06:59,515 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] [2018-01-28 22:06:59,515 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:06:59,515 INFO L82 PathProgramCache]: Analyzing trace with hash -860571953, now seen corresponding path program 1 times [2018-01-28 22:06:59,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:06:59,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:06:59,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:59,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:06:59,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:06:59,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:06:59,651 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:06:59,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:06:59,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:06:59,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:06:59,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:06:59,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:06:59,653 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 7 states. [2018-01-28 22:06:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:06:59,779 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2018-01-28 22:06:59,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:06:59,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-01-28 22:06:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:06:59,781 INFO L225 Difference]: With dead ends: 137 [2018-01-28 22:06:59,781 INFO L226 Difference]: Without dead ends: 136 [2018-01-28 22:06:59,782 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:06:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-28 22:06:59,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2018-01-28 22:06:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-28 22:06:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-01-28 22:06:59,789 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 43 [2018-01-28 22:06:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:06:59,789 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-01-28 22:06:59,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:06:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-01-28 22:06:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:06:59,791 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:06:59,791 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] [2018-01-28 22:06:59,791 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:06:59,792 INFO L82 PathProgramCache]: Analyzing trace with hash -860571952, now seen corresponding path program 1 times [2018-01-28 22:06:59,792 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:06:59,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:06:59,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:59,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:06:59,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:06:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:06:59,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:07:00,072 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:07:00,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:07:00,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:07:00,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:07:00,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:07:00,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:07:00,074 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 9 states. [2018-01-28 22:07:00,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:07:00,243 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-01-28 22:07:00,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:07:00,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-01-28 22:07:00,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:07:00,244 INFO L225 Difference]: With dead ends: 132 [2018-01-28 22:07:00,244 INFO L226 Difference]: Without dead ends: 131 [2018-01-28 22:07:00,245 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:07:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-28 22:07:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2018-01-28 22:07:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-28 22:07:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-28 22:07:00,249 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 43 [2018-01-28 22:07:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:07:00,250 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-28 22:07:00,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:07:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-28 22:07:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:07:00,251 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:07:00,251 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] [2018-01-28 22:07:00,252 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:07:00,252 INFO L82 PathProgramCache]: Analyzing trace with hash -860584894, now seen corresponding path program 1 times [2018-01-28 22:07:00,252 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:07:00,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:07:00,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:00,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:07:00,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:07:00,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:07:00,305 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:07:00,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:07:00,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:07:00,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:07:00,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:07:00,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:07:00,307 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 3 states. [2018-01-28 22:07:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:07:00,326 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-01-28 22:07:00,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:07:00,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-01-28 22:07:00,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:07:00,328 INFO L225 Difference]: With dead ends: 149 [2018-01-28 22:07:00,328 INFO L226 Difference]: Without dead ends: 99 [2018-01-28 22:07:00,328 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:07:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-28 22:07:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-28 22:07:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-28 22:07:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-01-28 22:07:00,334 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 43 [2018-01-28 22:07:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:07:00,334 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-01-28 22:07:00,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:07:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-01-28 22:07:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-28 22:07:00,335 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:07:00,335 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] [2018-01-28 22:07:00,336 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:07:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash -869165734, now seen corresponding path program 1 times [2018-01-28 22:07:00,336 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:07:00,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:07:00,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:00,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:07:00,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:07:00,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:07:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:07:00,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:07:00,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:07:00,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:07:00,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:07:00,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:07:00,421 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 5 states. [2018-01-28 22:07:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:07:00,530 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-01-28 22:07:00,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:07:00,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-01-28 22:07:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:07:00,531 INFO L225 Difference]: With dead ends: 135 [2018-01-28 22:07:00,531 INFO L226 Difference]: Without dead ends: 111 [2018-01-28 22:07:00,532 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:07:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-28 22:07:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2018-01-28 22:07:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-28 22:07:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-28 22:07:00,575 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 44 [2018-01-28 22:07:00,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:07:00,576 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-28 22:07:00,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:07:00,576 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-28 22:07:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-28 22:07:00,577 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:07:00,577 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, 1, 1, 1] [2018-01-28 22:07:00,577 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:07:00,577 INFO L82 PathProgramCache]: Analyzing trace with hash -123705359, now seen corresponding path program 1 times [2018-01-28 22:07:00,577 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:07:00,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:07:00,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:00,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:07:00,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:07:00,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:07:00,704 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:07:00,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:07:00,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:07:00,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:07:00,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:07:00,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:07:00,706 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 8 states. [2018-01-28 22:07:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:07:00,904 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-01-28 22:07:00,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:07:00,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-01-28 22:07:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:07:00,906 INFO L225 Difference]: With dead ends: 125 [2018-01-28 22:07:00,906 INFO L226 Difference]: Without dead ends: 124 [2018-01-28 22:07:00,906 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:07:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-28 22:07:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2018-01-28 22:07:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-28 22:07:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-01-28 22:07:00,910 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 48 [2018-01-28 22:07:00,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:07:00,911 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-01-28 22:07:00,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:07:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-01-28 22:07:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-28 22:07:00,912 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:07:00,912 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, 1, 1, 1] [2018-01-28 22:07:00,912 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:07:00,912 INFO L82 PathProgramCache]: Analyzing trace with hash -123705358, now seen corresponding path program 1 times [2018-01-28 22:07:00,912 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:07:00,912 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:07:00,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:00,913 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:07:00,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:07:00,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:07:00,993 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:07:00,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:07:00,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:07:00,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:07:00,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:07:00,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:07:00,994 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 5 states. [2018-01-28 22:07:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:07:01,134 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-01-28 22:07:01,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:07:01,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-01-28 22:07:01,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:07:01,136 INFO L225 Difference]: With dead ends: 105 [2018-01-28 22:07:01,136 INFO L226 Difference]: Without dead ends: 104 [2018-01-28 22:07:01,136 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:07:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-28 22:07:01,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-28 22:07:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-28 22:07:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-01-28 22:07:01,144 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 48 [2018-01-28 22:07:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:07:01,145 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-01-28 22:07:01,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:07:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-01-28 22:07:01,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 22:07:01,146 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:07:01,146 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, 1, 1, 1, 1, 1] [2018-01-28 22:07:01,146 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:07:01,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1378235474, now seen corresponding path program 1 times [2018-01-28 22:07:01,147 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:07:01,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:07:01,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:01,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:07:01,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:07:01,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:07:01,335 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:07:01,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:07:01,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:07:01,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:07:01,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:07:01,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:07:01,336 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 10 states. [2018-01-28 22:07:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:07:01,516 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-01-28 22:07:01,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:07:01,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-01-28 22:07:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:07:01,518 INFO L225 Difference]: With dead ends: 119 [2018-01-28 22:07:01,518 INFO L226 Difference]: Without dead ends: 118 [2018-01-28 22:07:01,518 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:07:01,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-28 22:07:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2018-01-28 22:07:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-28 22:07:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2018-01-28 22:07:01,524 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 50 [2018-01-28 22:07:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:07:01,525 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2018-01-28 22:07:01,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:07:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-01-28 22:07:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 22:07:01,526 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:07:01,526 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:07:01,526 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:07:01,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1930856651, now seen corresponding path program 1 times [2018-01-28 22:07:01,526 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:07:01,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:07:01,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:01,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:07:01,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:07:01,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:07:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:07:01,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:07:01,789 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:07:01,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:07:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:07:01,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:07:01,926 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:07:01,929 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:07:01,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:07:01,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:07:01,937 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:07:01,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-28 22:07:02,009 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 16 treesize of output 15 [2018-01-28 22:07:02,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:07:02,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:07:02,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-28 22:07:02,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-28 22:07:02,117 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 26 treesize of output 25 [2018-01-28 22:07:02,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:07:02,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:07:02,152 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:07:02,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-01-28 22:07:02,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-01-28 22:07:02,203 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 20 treesize of output 5 [2018-01-28 22:07:02,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:07:02,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:07:02,210 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:07:02,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-01-28 22:07:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:07:02,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:07:02,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2018-01-28 22:07:02,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-28 22:07:02,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-28 22:07:02,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-01-28 22:07:02,248 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 20 states. [2018-01-28 22:07:02,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:07:02,855 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2018-01-28 22:07:02,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:07:02,856 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-01-28 22:07:02,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:07:02,856 INFO L225 Difference]: With dead ends: 132 [2018-01-28 22:07:02,856 INFO L226 Difference]: Without dead ends: 131 [2018-01-28 22:07:02,857 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-01-28 22:07:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-28 22:07:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2018-01-28 22:07:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-28 22:07:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-01-28 22:07:02,864 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 54 [2018-01-28 22:07:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:07:02,865 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-01-28 22:07:02,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-28 22:07:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-01-28 22:07:02,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 22:07:02,866 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:07:02,866 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:07:02,866 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:07:02,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1930856650, now seen corresponding path program 1 times [2018-01-28 22:07:02,866 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:07:02,866 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:07:02,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:02,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:07:02,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:07:02,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:07:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:07:03,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:07:03,240 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:07:03,246 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:07:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:07:03,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:07:03,298 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:07:03,300 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:07:03,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,308 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:07:03,310 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:07:03,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,316 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:07:03,316 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-01-28 22:07:03,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:07:03,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:07:03,428 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 15 treesize of output 8 [2018-01-28 22:07:03,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 22:07:03,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-01-28 22:07:03,576 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 3 case distinctions, treesize of input 23 treesize of output 33 [2018-01-28 22:07:03,580 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 24 treesize of output 23 [2018-01-28 22:07:03,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,620 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 3 case distinctions, treesize of input 33 treesize of output 41 [2018-01-28 22:07:03,625 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 34 treesize of output 33 [2018-01-28 22:07:03,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,650 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:07:03,651 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-01-28 22:07:03,696 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 1 case distinctions, treesize of input 36 treesize of output 34 [2018-01-28 22:07:03,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-01-28 22:07:03,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,738 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 1 case distinctions, treesize of input 26 treesize of output 26 [2018-01-28 22:07:03,742 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 18 treesize of output 3 [2018-01-28 22:07:03,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:07:03,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:07:03,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-01-28 22:07:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:07:03,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:07:03,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21 [2018-01-28 22:07:03,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-28 22:07:03,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-28 22:07:03,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=405, Unknown=1, NotChecked=0, Total=462 [2018-01-28 22:07:03,813 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 22 states. [2018-01-28 22:07:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:07:04,681 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2018-01-28 22:07:04,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:07:04,681 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-01-28 22:07:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:07:04,682 INFO L225 Difference]: With dead ends: 131 [2018-01-28 22:07:04,683 INFO L226 Difference]: Without dead ends: 130 [2018-01-28 22:07:04,683 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=866, Unknown=1, NotChecked=0, Total=1056 [2018-01-28 22:07:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-28 22:07:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2018-01-28 22:07:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-28 22:07:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-01-28 22:07:04,690 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 54 [2018-01-28 22:07:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:07:04,690 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-01-28 22:07:04,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-28 22:07:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-01-28 22:07:04,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-28 22:07:04,691 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:07:04,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:07:04,691 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:07:04,691 INFO L82 PathProgramCache]: Analyzing trace with hash -581451455, now seen corresponding path program 1 times [2018-01-28 22:07:04,691 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:07:04,691 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:07:04,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:04,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:07:04,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:07:04,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:07:04,760 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:07:04,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:07:04,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:07:04,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:07:04,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:07:04,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:07:04,761 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 7 states. [2018-01-28 22:07:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:07:04,807 INFO L93 Difference]: Finished difference Result 155 states and 161 transitions. [2018-01-28 22:07:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:07:04,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-01-28 22:07:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:07:04,808 INFO L225 Difference]: With dead ends: 155 [2018-01-28 22:07:04,808 INFO L226 Difference]: Without dead ends: 131 [2018-01-28 22:07:04,809 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:07:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-28 22:07:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2018-01-28 22:07:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-28 22:07:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2018-01-28 22:07:04,813 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 57 [2018-01-28 22:07:04,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:07:04,813 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2018-01-28 22:07:04,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:07:04,813 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-01-28 22:07:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-28 22:07:04,813 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:07:04,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:07:04,813 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-28 22:07:04,814 INFO L82 PathProgramCache]: Analyzing trace with hash -430177282, now seen corresponding path program 1 times [2018-01-28 22:07:04,814 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:07:04,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:07:04,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:04,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:07:04,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:07:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 22:07:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 22:07:04,877 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 22:07:04,903 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-28 22:07:04,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:07:04 BoogieIcfgContainer [2018-01-28 22:07:04,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:07:04,926 INFO L168 Benchmark]: Toolchain (without parser) took 8107.80 ms. Allocated memory was 301.5 MB in the beginning and 585.1 MB in the end (delta: 283.6 MB). Free memory was 259.3 MB in the beginning and 434.4 MB in the end (delta: -175.1 MB). Peak memory consumption was 108.5 MB. Max. memory is 5.3 GB. [2018-01-28 22:07:04,927 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 301.5 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:07:04,928 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.23 ms. Allocated memory is still 301.5 MB. Free memory was 258.3 MB in the beginning and 247.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-28 22:07:04,928 INFO L168 Benchmark]: Boogie Preprocessor took 34.56 ms. Allocated memory is still 301.5 MB. Free memory was 247.3 MB in the beginning and 246.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-28 22:07:04,928 INFO L168 Benchmark]: RCFGBuilder took 470.06 ms. Allocated memory is still 301.5 MB. Free memory was 246.3 MB in the beginning and 214.8 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 5.3 GB. [2018-01-28 22:07:04,928 INFO L168 Benchmark]: TraceAbstraction took 7392.11 ms. Allocated memory was 301.5 MB in the beginning and 585.1 MB in the end (delta: 283.6 MB). Free memory was 214.8 MB in the beginning and 434.4 MB in the end (delta: -219.6 MB). Peak memory consumption was 64.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:07:04,930 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.25 ms. Allocated memory is still 301.5 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.23 ms. Allocated memory is still 301.5 MB. Free memory was 258.3 MB in the beginning and 247.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.56 ms. Allocated memory is still 301.5 MB. Free memory was 247.3 MB in the beginning and 246.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 470.06 ms. Allocated memory is still 301.5 MB. Free memory was 246.3 MB in the beginning and 214.8 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7392.11 ms. Allocated memory was 301.5 MB in the beginning and 585.1 MB in the end (delta: 283.6 MB). Free memory was 214.8 MB in the beginning and 434.4 MB in the end (delta: -219.6 MB). Peak memory consumption was 64.0 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: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: IVAL [\old(c)=12, c=12] [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, c=0, list={10:0}] [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={10:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={10:0}] [L627] c++ VAL [\old(c)=0, c=1, plist={10:0}, plist={10:0}] [L628] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L629] EXPR, FCALL \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L629] FCALL item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L630] EXPR, FCALL item->next VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L632] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, \old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, \old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L633] RET, FCALL *plist = item VAL [\old(c)=0, c=1, item={11:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L640] append(&list) VAL [\old(c)=0, c=1, length=0, list={10:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={10:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) VAL [\old(c)=0, __VERIFIER_nondet_int()=0, c=1, length=1, list={10:0}] [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={10:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={10:0}] [L647] EXPR, FCALL \read(*list) VAL [\old(c)=0, \read(*list)={11:0}, c=1, length=1, list={10:0}] [L647] EXPR, FCALL list->next VAL [\old(c)=0, \read(*list)={11:0}, c=1, length=1, list={10:0}, list->next={0:0}] [L647] struct item *next = list->next; VAL [\old(c)=0, \read(*list)={11:0}, c=1, length=1, list={10:0}, list->next={0:0}, next={0:0}] [L648] EXPR, FCALL \read(*list) VAL [\old(c)=0, \read(*list)={11:0}, c=1, length=1, list={10:0}, next={0:0}] [L648] FCALL free(list) VAL [\old(c)=0, \read(*list)={11:0}, c=1, length=1, list={10:0}, next={0:0}] [L649] FCALL list = next VAL [\old(c)=0, c=1, length=1, list={10:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={10:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={10:0}, next={0:0}] [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, list={10:0}, next={0:0}] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, \result=0, c=1, length=0, list={10:0}, next={0:0}] [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 126 locations, 43 error locations. UNSAFE Result, 7.3s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1497 SDtfs, 1270 SDslu, 4916 SDs, 0 SdLazy, 2672 SolverSat, 141 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 107 SyntacticMatches, 11 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=0, 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.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 143 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 772 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 694 ConstructedInterpolants, 11 QuantifiedInterpolants, 242712 SizeOfPredicates, 35 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 12/52 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/test-0232_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-07-04-937.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-07-04-937.csv Received shutdown request...