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/memsafety/test-0232_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:31:25,939 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:31:25,941 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:31:25,953 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:31:25,953 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:31:25,954 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:31:25,955 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:31:25,958 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:31:25,960 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:31:25,961 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:31:25,962 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:31:25,962 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:31:25,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:31:25,963 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:31:25,964 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:31:25,967 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:31:25,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:31:25,971 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:31:25,972 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:31:25,973 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:31:25,976 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:31:25,976 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:31:25,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:31:25,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:31:25,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:31:25,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:31:25,980 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:31:25,980 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:31:25,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:31:25,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:31:25,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:31:25,982 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 21:31:25,991 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:31:25,992 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:31:25,993 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:31:25,993 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:31:25,993 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:31:25,993 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:31:25,993 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:31:25,994 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:31:25,994 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:31:25,995 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:31:25,995 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:31:25,995 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:31:25,995 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:31:25,995 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:31:25,995 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:31:25,996 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:31:25,996 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:31:25,996 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:31:25,996 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:31:25,996 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:31:25,997 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:31:25,997 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:31:25,997 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:31:25,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:31:25,997 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:31:25,998 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:31:25,998 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:31:25,998 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:31:25,998 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:31:25,998 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:31:25,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:31:25,999 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:31:26,000 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:31:26,000 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:31:26,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:31:26,048 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:31:26,052 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:31:26,053 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:31:26,054 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:31:26,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-memtrack.i [2018-01-28 21:31:26,237 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:31:26,244 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:31:26,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:31:26,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:31:26,252 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:31:26,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:31:26" (1/1) ... [2018-01-28 21:31:26,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c871af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:31:26, skipping insertion in model container [2018-01-28 21:31:26,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:31:26" (1/1) ... [2018-01-28 21:31:26,274 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:31:26,314 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:31:26,426 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:31:26,442 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:31:26,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:31:26 WrapperNode [2018-01-28 21:31:26,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:31:26,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:31:26,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:31:26,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:31:26,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:31:26" (1/1) ... [2018-01-28 21:31:26,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:31:26" (1/1) ... [2018-01-28 21:31:26,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:31:26" (1/1) ... [2018-01-28 21:31:26,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:31:26" (1/1) ... [2018-01-28 21:31:26,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:31:26" (1/1) ... [2018-01-28 21:31:26,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:31:26" (1/1) ... [2018-01-28 21:31:26,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:31:26" (1/1) ... [2018-01-28 21:31:26,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:31:26,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:31:26,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:31:26,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:31:26,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:31:26" (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 21:31:26,528 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:31:26,528 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:31:26,528 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-28 21:31:26,528 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:31:26,528 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 21:31:26,528 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 21:31:26,528 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:31:26,528 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:31:26,529 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:31:26,529 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 21:31:26,529 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 21:31:26,529 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:31:26,529 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-28 21:31:26,529 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:31:26,529 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:31:26,529 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:31:26,920 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:31:26,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:31:26 BoogieIcfgContainer [2018-01-28 21:31:26,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:31:26,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:31:26,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:31:26,924 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:31:26,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:31:26" (1/3) ... [2018-01-28 21:31:26,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0ca407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:31:26, skipping insertion in model container [2018-01-28 21:31:26,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:31:26" (2/3) ... [2018-01-28 21:31:26,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0ca407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:31:26, skipping insertion in model container [2018-01-28 21:31:26,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:31:26" (3/3) ... [2018-01-28 21:31:26,928 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-01-28 21:31:26,935 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:31:26,941 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-01-28 21:31:26,981 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:31:26,981 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:31:26,981 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:31:26,981 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:31:26,981 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:31:26,981 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:31:26,981 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:31:26,982 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:31:26,982 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:31:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2018-01-28 21:31:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-28 21:31:27,005 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:27,006 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:31:27,006 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:27,010 INFO L82 PathProgramCache]: Analyzing trace with hash 769081276, now seen corresponding path program 1 times [2018-01-28 21:31:27,012 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:27,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:27,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:27,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:27,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:27,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:27,152 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 21:31:27,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:27,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 21:31:27,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:31:27,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:31:27,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:31:27,177 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 3 states. [2018-01-28 21:31:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:27,439 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2018-01-28 21:31:27,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:31:27,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-01-28 21:31:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:27,456 INFO L225 Difference]: With dead ends: 166 [2018-01-28 21:31:27,456 INFO L226 Difference]: Without dead ends: 103 [2018-01-28 21:31:27,460 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 21:31:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-28 21:31:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-01-28 21:31:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-28 21:31:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-01-28 21:31:27,501 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 8 [2018-01-28 21:31:27,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:27,501 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-01-28 21:31:27,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:31:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-01-28 21:31:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-28 21:31:27,502 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:27,502 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:31:27,502 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:27,502 INFO L82 PathProgramCache]: Analyzing trace with hash 769081277, now seen corresponding path program 1 times [2018-01-28 21:31:27,502 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:27,503 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:27,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:27,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:27,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:27,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:27,588 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 21:31:27,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:27,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 21:31:27,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:31:27,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:31:27,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:31:27,590 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 3 states. [2018-01-28 21:31:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:27,711 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-01-28 21:31:27,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:31:27,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-01-28 21:31:27,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:27,714 INFO L225 Difference]: With dead ends: 103 [2018-01-28 21:31:27,714 INFO L226 Difference]: Without dead ends: 102 [2018-01-28 21:31:27,715 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 21:31:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-28 21:31:27,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-01-28 21:31:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-28 21:31:27,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2018-01-28 21:31:27,726 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 8 [2018-01-28 21:31:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:27,727 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2018-01-28 21:31:27,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:31:27,727 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2018-01-28 21:31:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-28 21:31:27,727 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:27,728 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:31:27,728 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:27,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1686551010, now seen corresponding path program 1 times [2018-01-28 21:31:27,728 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:27,728 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:27,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:27,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:27,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:27,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:31:27,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:27,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:31:27,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:31:27,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:31:27,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:31:27,894 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 5 states. [2018-01-28 21:31:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:28,026 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-01-28 21:31:28,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:31:28,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-28 21:31:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:28,028 INFO L225 Difference]: With dead ends: 100 [2018-01-28 21:31:28,028 INFO L226 Difference]: Without dead ends: 97 [2018-01-28 21:31:28,029 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 21:31:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-28 21:31:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-01-28 21:31:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-28 21:31:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-01-28 21:31:28,038 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 14 [2018-01-28 21:31:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:28,038 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-01-28 21:31:28,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:31:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-01-28 21:31:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-28 21:31:28,039 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:28,039 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:31:28,039 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1686551009, now seen corresponding path program 1 times [2018-01-28 21:31:28,040 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:28,040 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:28,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:28,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:28,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:28,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:28,245 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 21:31:28,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:28,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:31:28,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:31:28,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:31:28,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:31:28,247 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 7 states. [2018-01-28 21:31:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:28,438 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-01-28 21:31:28,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:31:28,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-28 21:31:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:28,439 INFO L225 Difference]: With dead ends: 97 [2018-01-28 21:31:28,439 INFO L226 Difference]: Without dead ends: 87 [2018-01-28 21:31:28,439 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:31:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-28 21:31:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-28 21:31:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-28 21:31:28,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-01-28 21:31:28,445 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 14 [2018-01-28 21:31:28,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:28,445 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-01-28 21:31:28,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:31:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-01-28 21:31:28,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 21:31:28,446 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:28,446 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:31:28,446 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:28,446 INFO L82 PathProgramCache]: Analyzing trace with hash -743473684, now seen corresponding path program 1 times [2018-01-28 21:31:28,446 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:28,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:28,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:28,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:28,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:28,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:28,487 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 21:31:28,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:28,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:31:28,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:31:28,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:31:28,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:31:28,488 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 4 states. [2018-01-28 21:31:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:28,572 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-01-28 21:31:28,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:31:28,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-28 21:31:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:28,574 INFO L225 Difference]: With dead ends: 87 [2018-01-28 21:31:28,574 INFO L226 Difference]: Without dead ends: 83 [2018-01-28 21:31:28,575 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 21:31:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-28 21:31:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-28 21:31:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 21:31:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-01-28 21:31:28,583 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 15 [2018-01-28 21:31:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:28,583 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-01-28 21:31:28,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:31:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-01-28 21:31:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 21:31:28,584 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:28,584 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:31:28,585 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:28,585 INFO L82 PathProgramCache]: Analyzing trace with hash -743473683, now seen corresponding path program 1 times [2018-01-28 21:31:28,585 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:28,585 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:28,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:28,587 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:28,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:28,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:28,654 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 21:31:28,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:28,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:31:28,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:31:28,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:31:28,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:31:28,655 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 4 states. [2018-01-28 21:31:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:28,721 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-01-28 21:31:28,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:31:28,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-28 21:31:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:28,722 INFO L225 Difference]: With dead ends: 83 [2018-01-28 21:31:28,722 INFO L226 Difference]: Without dead ends: 79 [2018-01-28 21:31:28,723 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 21:31:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-28 21:31:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-28 21:31:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-28 21:31:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2018-01-28 21:31:28,728 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 15 [2018-01-28 21:31:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:28,728 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-01-28 21:31:28,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:31:28,728 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-01-28 21:31:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:31:28,729 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:28,729 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 21:31:28,729 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash 110108265, now seen corresponding path program 1 times [2018-01-28 21:31:28,729 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:28,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:28,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:28,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:28,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:28,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:28,831 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 21:31:28,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:28,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:31:28,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:31:28,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:31:28,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:31:28,832 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 8 states. [2018-01-28 21:31:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:29,009 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2018-01-28 21:31:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:31:29,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-28 21:31:29,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:29,010 INFO L225 Difference]: With dead ends: 168 [2018-01-28 21:31:29,010 INFO L226 Difference]: Without dead ends: 97 [2018-01-28 21:31:29,011 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:31:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-28 21:31:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2018-01-28 21:31:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-28 21:31:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-01-28 21:31:29,021 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 20 [2018-01-28 21:31:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:29,021 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-01-28 21:31:29,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:31:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-01-28 21:31:29,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 21:31:29,024 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:29,024 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] [2018-01-28 21:31:29,024 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:29,024 INFO L82 PathProgramCache]: Analyzing trace with hash -543445591, now seen corresponding path program 1 times [2018-01-28 21:31:29,024 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:29,024 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:29,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:29,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:29,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:29,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:29,125 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 21:31:29,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:29,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:31:29,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:31:29,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:31:29,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:31:29,128 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 7 states. [2018-01-28 21:31:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:29,338 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-01-28 21:31:29,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:31:29,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-28 21:31:29,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:29,339 INFO L225 Difference]: With dead ends: 107 [2018-01-28 21:31:29,339 INFO L226 Difference]: Without dead ends: 106 [2018-01-28 21:31:29,339 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 21:31:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-28 21:31:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2018-01-28 21:31:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-28 21:31:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-01-28 21:31:29,347 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 36 [2018-01-28 21:31:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:29,347 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-01-28 21:31:29,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:31:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-01-28 21:31:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 21:31:29,348 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:29,349 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] [2018-01-28 21:31:29,349 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:29,349 INFO L82 PathProgramCache]: Analyzing trace with hash -543445590, now seen corresponding path program 1 times [2018-01-28 21:31:29,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:29,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:29,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:29,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:29,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:29,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:29,489 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 21:31:29,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:29,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:31:29,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:31:29,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:31:29,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:31:29,490 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 9 states. [2018-01-28 21:31:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:29,674 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-01-28 21:31:29,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 21:31:29,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-01-28 21:31:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:29,675 INFO L225 Difference]: With dead ends: 110 [2018-01-28 21:31:29,676 INFO L226 Difference]: Without dead ends: 109 [2018-01-28 21:31:29,676 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-01-28 21:31:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-28 21:31:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2018-01-28 21:31:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-28 21:31:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-01-28 21:31:29,682 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 36 [2018-01-28 21:31:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:29,682 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-01-28 21:31:29,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:31:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-01-28 21:31:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:31:29,683 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:29,683 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] [2018-01-28 21:31:29,683 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:29,683 INFO L82 PathProgramCache]: Analyzing trace with hash -830778036, now seen corresponding path program 1 times [2018-01-28 21:31:29,683 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:29,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:29,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:29,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:29,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:29,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:29,744 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 21:31:29,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:29,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:31:29,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:31:29,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:31:29,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:31:29,746 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 5 states. [2018-01-28 21:31:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:29,849 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2018-01-28 21:31:29,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:31:29,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-01-28 21:31:29,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:29,851 INFO L225 Difference]: With dead ends: 118 [2018-01-28 21:31:29,851 INFO L226 Difference]: Without dead ends: 94 [2018-01-28 21:31:29,852 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 21:31:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-28 21:31:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-01-28 21:31:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-28 21:31:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-01-28 21:31:29,858 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 40 [2018-01-28 21:31:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:29,859 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-01-28 21:31:29,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:31:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-01-28 21:31:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 21:31:29,860 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:29,861 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:31:29,861 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:29,861 INFO L82 PathProgramCache]: Analyzing trace with hash 10325446, now seen corresponding path program 1 times [2018-01-28 21:31:29,861 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:29,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:29,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:29,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:29,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:29,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:29,914 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 21:31:29,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:29,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:31:29,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:31:29,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:31:29,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:31:29,915 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 5 states. [2018-01-28 21:31:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:29,988 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-01-28 21:31:29,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:31:29,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-28 21:31:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:29,989 INFO L225 Difference]: With dead ends: 90 [2018-01-28 21:31:29,989 INFO L226 Difference]: Without dead ends: 89 [2018-01-28 21:31:29,990 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 21:31:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-28 21:31:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-28 21:31:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-28 21:31:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-01-28 21:31:29,993 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 41 [2018-01-28 21:31:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:29,993 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-01-28 21:31:29,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:31:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-01-28 21:31:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 21:31:29,994 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:29,994 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:31:29,994 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash 10325445, now seen corresponding path program 1 times [2018-01-28 21:31:29,994 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:29,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:29,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:29,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:29,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:30,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:30,115 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 21:31:30,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:30,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:31:30,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:31:30,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:31:30,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:31:30,118 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 8 states. [2018-01-28 21:31:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:30,222 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-01-28 21:31:30,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:31:30,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-01-28 21:31:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:30,223 INFO L225 Difference]: With dead ends: 93 [2018-01-28 21:31:30,223 INFO L226 Difference]: Without dead ends: 92 [2018-01-28 21:31:30,223 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 21:31:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-28 21:31:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-01-28 21:31:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-28 21:31:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-01-28 21:31:30,228 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 41 [2018-01-28 21:31:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:30,228 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-01-28 21:31:30,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:31:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-01-28 21:31:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 21:31:30,229 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:30,229 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] [2018-01-28 21:31:30,230 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:30,230 INFO L82 PathProgramCache]: Analyzing trace with hash 398243147, now seen corresponding path program 1 times [2018-01-28 21:31:30,230 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:30,230 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:30,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:30,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:30,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:30,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:30,332 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 21:31:30,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:30,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:31:30,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:31:30,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:31:30,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:31:30,333 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 8 states. [2018-01-28 21:31:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:30,493 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-01-28 21:31:30,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:31:30,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-01-28 21:31:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:30,494 INFO L225 Difference]: With dead ends: 94 [2018-01-28 21:31:30,494 INFO L226 Difference]: Without dead ends: 84 [2018-01-28 21:31:30,495 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:31:30,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-28 21:31:30,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-28 21:31:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 21:31:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-01-28 21:31:30,498 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 42 [2018-01-28 21:31:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:30,499 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-01-28 21:31:30,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:31:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-01-28 21:31:30,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 21:31:30,500 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:30,500 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:31:30,500 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:30,501 INFO L82 PathProgramCache]: Analyzing trace with hash 12360805, now seen corresponding path program 1 times [2018-01-28 21:31:30,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:30,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:30,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:30,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:30,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:30,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:31:30,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:31:30,855 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 21:31:30,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:30,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:31:31,046 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 21:31:31,048 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 21:31:31,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:31,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:31,063 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 21:31:31,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-28 21:31:31,148 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 21:31:31,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:31,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:31,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-28 21:31:31,277 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 21:31:31,282 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 21:31:31,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:31,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:31,320 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 21:31:31,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-01-28 21:31:31,421 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 21:31:31,425 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 21:31:31,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:31,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:31,434 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 21:31:31,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-01-28 21:31:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:31:31,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:31:31,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2018-01-28 21:31:31,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-28 21:31:31,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-28 21:31:31,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-01-28 21:31:31,472 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 20 states. [2018-01-28 21:31:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:32,063 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-01-28 21:31:32,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 21:31:32,063 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-01-28 21:31:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:32,064 INFO L225 Difference]: With dead ends: 98 [2018-01-28 21:31:32,064 INFO L226 Difference]: Without dead ends: 97 [2018-01-28 21:31:32,065 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-01-28 21:31:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-28 21:31:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-01-28 21:31:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-28 21:31:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-01-28 21:31:32,071 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 43 [2018-01-28 21:31:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:32,071 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-01-28 21:31:32,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-28 21:31:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-01-28 21:31:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 21:31:32,072 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:32,072 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:31:32,072 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:32,072 INFO L82 PathProgramCache]: Analyzing trace with hash 12360806, now seen corresponding path program 1 times [2018-01-28 21:31:32,072 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:32,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:32,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:32,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:32,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:32,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:31:32,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:31:32,286 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 21:31:32,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:32,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:31:32,342 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 21:31:32,344 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 21:31:32,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,353 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 21:31:32,355 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 21:31:32,356 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,369 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 21:31:32,369 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-01-28 21:31:32,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:32,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:31:32,441 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 21:31:32,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,449 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 21:31:32,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-01-28 21:31:32,550 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 21:31:32,554 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 21:31:32,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,594 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 21:31:32,599 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 21:31:32,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,627 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 21:31:32,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-01-28 21:31:32,669 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 21:31:32,686 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 21:31:32,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,736 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 21:31:32,740 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 21:31:32,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:31:32,753 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 21:31:32,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-01-28 21:31:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:31:32,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:31:32,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21 [2018-01-28 21:31:32,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-28 21:31:32,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-28 21:31:32,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-01-28 21:31:32,803 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 22 states. [2018-01-28 21:31:33,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:33,626 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-01-28 21:31:33,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 21:31:33,626 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-01-28 21:31:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:33,627 INFO L225 Difference]: With dead ends: 97 [2018-01-28 21:31:33,627 INFO L226 Difference]: Without dead ends: 96 [2018-01-28 21:31:33,627 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 21:31:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-28 21:31:33,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-01-28 21:31:33,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-28 21:31:33,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-01-28 21:31:33,634 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 43 [2018-01-28 21:31:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:33,634 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-01-28 21:31:33,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-28 21:31:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-01-28 21:31:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 21:31:33,635 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:33,635 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 21:31:33,635 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:33,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1332818662, now seen corresponding path program 1 times [2018-01-28 21:31:33,635 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:33,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:33,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:33,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:33,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:33,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:33,805 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 21:31:33,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:33,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 21:31:33,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 21:31:33,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 21:31:33,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:31:33,806 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 12 states. [2018-01-28 21:31:33,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:33,964 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-01-28 21:31:33,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 21:31:33,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-01-28 21:31:33,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:33,965 INFO L225 Difference]: With dead ends: 92 [2018-01-28 21:31:33,965 INFO L226 Difference]: Without dead ends: 91 [2018-01-28 21:31:33,966 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-01-28 21:31:33,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-28 21:31:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-01-28 21:31:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-28 21:31:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-01-28 21:31:33,971 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 43 [2018-01-28 21:31:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:33,972 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-01-28 21:31:33,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 21:31:33,972 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-01-28 21:31:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:31:33,973 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:33,973 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] [2018-01-28 21:31:33,973 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:33,973 INFO L82 PathProgramCache]: Analyzing trace with hash -396319028, now seen corresponding path program 1 times [2018-01-28 21:31:33,973 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:33,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:33,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:33,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:33,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:31:33,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:31:34,656 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 21:31:34,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:31:34,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-01-28 21:31:34,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-28 21:31:34,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-28 21:31:34,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-01-28 21:31:34,657 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 19 states. [2018-01-28 21:31:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:31:35,483 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-01-28 21:31:35,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 21:31:35,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-01-28 21:31:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:31:35,484 INFO L225 Difference]: With dead ends: 142 [2018-01-28 21:31:35,484 INFO L226 Difference]: Without dead ends: 118 [2018-01-28 21:31:35,485 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2018-01-28 21:31:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-28 21:31:35,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2018-01-28 21:31:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-28 21:31:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2018-01-28 21:31:35,492 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 49 [2018-01-28 21:31:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:31:35,492 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2018-01-28 21:31:35,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-28 21:31:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2018-01-28 21:31:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-28 21:31:35,493 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:31:35,493 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] [2018-01-28 21:31:35,493 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, 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 21:31:35,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1301522123, now seen corresponding path program 1 times [2018-01-28 21:31:35,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:31:35,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:31:35,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:35,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:31:35,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:31:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 21:31:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 21:31:35,553 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 21:31:35,576 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-28 21:31:35,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:31:35 BoogieIcfgContainer [2018-01-28 21:31:35,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:31:35,599 INFO L168 Benchmark]: Toolchain (without parser) took 9361.41 ms. Allocated memory was 306.2 MB in the beginning and 587.2 MB in the end (delta: 281.0 MB). Free memory was 264.9 MB in the beginning and 378.0 MB in the end (delta: -113.1 MB). Peak memory consumption was 168.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:31:35,601 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 306.2 MB. Free memory is still 270.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:31:35,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.84 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 255.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:31:35,601 INFO L168 Benchmark]: Boogie Preprocessor took 34.39 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 253.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:31:35,602 INFO L168 Benchmark]: RCFGBuilder took 437.28 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 224.0 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 5.3 GB. [2018-01-28 21:31:35,602 INFO L168 Benchmark]: TraceAbstraction took 8676.97 ms. Allocated memory was 306.2 MB in the beginning and 587.2 MB in the end (delta: 281.0 MB). Free memory was 224.0 MB in the beginning and 378.0 MB in the end (delta: -154.0 MB). Peak memory consumption was 127.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:31:35,604 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.18 ms. Allocated memory is still 306.2 MB. Free memory is still 270.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.84 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 255.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.39 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 253.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 437.28 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 224.0 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8676.97 ms. Allocated memory was 306.2 MB in the beginning and 587.2 MB in the end (delta: 281.0 MB). Free memory was 224.0 MB in the beginning and 378.0 MB in the end (delta: -154.0 MB). Peak memory consumption was 127.1 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: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] FCALL struct item *list = ((void *)0); VAL [list={9:0}] [L637] CALL append(&list) VAL [plist={9:0}] [L626] EXPR, FCALL malloc(sizeof *item) VAL [malloc(sizeof *item)={10:0}, plist={9:0}, plist={9:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={10:0}, malloc(sizeof *item)={10:0}, plist={9:0}, plist={9:0}] [L627] EXPR, FCALL \read(**plist) VAL [\read(**plist)={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, plist={9:0}, plist={9:0}] [L627] FCALL item->next = *plist VAL [\read(**plist)={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, plist={9:0}, plist={9:0}] [L628] EXPR, FCALL item->next VAL [item={10:0}, item->next={0:0}, malloc(sizeof *item)={10:0}, plist={9:0}, plist={9:0}] [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [item={10:0}, item->next={0:0}, malloc(sizeof *item)={10:0}, plist={9:0}, plist={9:0}] [L630] EXPR, FCALL malloc(sizeof *item) VAL [item={10:0}, item->next={0:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *item)={13:0}, plist={9:0}, plist={9:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={10:0}, item->next={0:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *item)={13:0}, plist={9:0}, plist={9:0}] [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={10:0}, item->next={0:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *item)={13:0}, plist={9:0}, plist={9:0}] [L631] RET, FCALL *plist = item VAL [item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *item)={13:0}, plist={9:0}, plist={9:0}] [L637] append(&list) VAL [list={9:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, list={9:0}] [L639] FCALL \read(*list) VAL [\read(*list)={10:0}, list={9:0}] [L639] COND TRUE \read(*list) VAL [\read(*list)={10:0}, list={9:0}] [L640] EXPR, FCALL \read(*list) VAL [\read(*list)={10:0}, list={9:0}] [L640] EXPR, FCALL list->next VAL [\read(*list)={10:0}, list={9:0}, list->next={0:0}] [L640] struct item *next = list->next; VAL [\read(*list)={10:0}, list={9:0}, list->next={0:0}, next={0:0}] [L641] EXPR, FCALL \read(*list) VAL [\read(*list)={10:0}, list={9:0}, next={0:0}] [L641] FCALL free(list) VAL [\read(*list)={10:0}, list={9:0}, next={0:0}] [L642] FCALL list = next VAL [list={9:0}, next={0:0}] [L644] FCALL \read(*list) VAL [\read(*list)={0:0}, list={9:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) VAL [\read(*list)={0:0}, list={9:0}, next={0:0}] [L649] return 0; VAL [\result=0, list={9:0}, next={0:0}] [L635] FCALL struct item *list = ((void *)0); VAL [\result=0, list={9:0}, next={0:0}] [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 110 locations, 41 error locations. UNSAFE Result, 8.6s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1149 SDtfs, 1159 SDslu, 3820 SDs, 0 SdLazy, 2901 SolverSat, 134 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 84 SyntacticMatches, 15 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred 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, 77 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 645 NumberOfCodeBlocks, 645 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 575 ConstructedInterpolants, 11 QuantifiedInterpolants, 231508 SizeOfPredicates, 35 NumberOfNonLiveVariables, 382 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 12/40 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_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-31-35-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-31-35-612.csv Received shutdown request...