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_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:54:36,933 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:54:36,934 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:54:36,949 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:54:36,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:54:36,951 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:54:36,952 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:54:36,954 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:54:36,955 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:54:36,956 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:54:36,957 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:54:36,957 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:54:36,958 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:54:36,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:54:36,961 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:54:36,963 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:54:36,965 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:54:36,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:54:36,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:54:36,970 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:54:36,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:54:36,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:54:36,972 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:54:36,974 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:54:36,974 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:54:36,976 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:54:36,976 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:54:36,977 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:54:36,977 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:54:36,977 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:54:36,978 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:54:36,978 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-24 23:54:36,986 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:54:36,986 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:54:36,987 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:54:36,987 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:54:36,987 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:54:36,987 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:54:36,987 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:54:36,987 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:54:36,988 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:54:36,988 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:54:36,988 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:54:36,988 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:54:36,988 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:54:36,988 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:54:36,988 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:54:36,989 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:54:36,989 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:54:36,989 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:54:36,989 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:54:36,989 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:54:36,989 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:54:36,989 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:54:36,990 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:54:36,990 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:54:36,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:54:36,990 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:54:36,990 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:54:36,990 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:54:36,991 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:54:36,991 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:54:36,991 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:54:36,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:54:36,991 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:54:36,991 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:54:36,992 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:54:36,992 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:54:37,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:54:37,038 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:54:37,041 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:54:37,043 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:54:37,043 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:54:37,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-01-24 23:54:37,200 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:54:37,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:54:37,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:54:37,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:54:37,211 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:54:37,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:54:37" (1/1) ... [2018-01-24 23:54:37,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d56f953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:37, skipping insertion in model container [2018-01-24 23:54:37,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:54:37" (1/1) ... [2018-01-24 23:54:37,229 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:54:37,268 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:54:37,392 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:54:37,412 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:54:37,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:37 WrapperNode [2018-01-24 23:54:37,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:54:37,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:54:37,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:54:37,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:54:37,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:37" (1/1) ... [2018-01-24 23:54:37,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:37" (1/1) ... [2018-01-24 23:54:37,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:37" (1/1) ... [2018-01-24 23:54:37,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:37" (1/1) ... [2018-01-24 23:54:37,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:37" (1/1) ... [2018-01-24 23:54:37,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:37" (1/1) ... [2018-01-24 23:54:37,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:37" (1/1) ... [2018-01-24 23:54:37,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:54:37,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:54:37,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:54:37,460 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:54:37,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:37" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:54:37,512 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:54:37,513 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:54:37,513 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 23:54:37,513 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:54:37,513 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 23:54:37,513 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 23:54:37,513 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:54:37,513 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:54:37,513 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:54:37,514 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 23:54:37,514 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 23:54:37,514 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:54:37,514 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 23:54:37,514 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:54:37,514 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:54:37,514 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:54:37,899 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:54:37,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:54:37 BoogieIcfgContainer [2018-01-24 23:54:37,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:54:37,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:54:37,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:54:37,902 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:54:37,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:54:37" (1/3) ... [2018-01-24 23:54:37,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b5617f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:54:37, skipping insertion in model container [2018-01-24 23:54:37,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:54:37" (2/3) ... [2018-01-24 23:54:37,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b5617f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:54:37, skipping insertion in model container [2018-01-24 23:54:37,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:54:37" (3/3) ... [2018-01-24 23:54:37,906 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-01-24 23:54:37,915 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:54:37,923 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-24 23:54:37,966 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:54:37,966 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:54:37,966 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:54:37,966 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:54:37,966 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:54:37,966 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:54:37,967 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:54:37,967 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:54:37,967 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:54:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2018-01-24 23:54:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 23:54:37,994 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:37,995 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:54:37,995 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:37,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2046659462, now seen corresponding path program 1 times [2018-01-24 23:54:38,001 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:38,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:38,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:38,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:38,043 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:38,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:38,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:38,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 23:54:38,158 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:38,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:54:38,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:54:38,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:54:38,173 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 3 states. [2018-01-24 23:54:38,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:38,476 INFO L93 Difference]: Finished difference Result 167 states and 181 transitions. [2018-01-24 23:54:38,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:54:38,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 23:54:38,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:38,504 INFO L225 Difference]: With dead ends: 167 [2018-01-24 23:54:38,504 INFO L226 Difference]: Without dead ends: 106 [2018-01-24 23:54:38,507 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:54:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-24 23:54:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2018-01-24 23:54:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-24 23:54:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-01-24 23:54:38,544 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 7 [2018-01-24 23:54:38,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:38,544 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-01-24 23:54:38,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:54:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-01-24 23:54:38,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 23:54:38,545 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:38,545 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:54:38,545 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:38,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2046659463, now seen corresponding path program 1 times [2018-01-24 23:54:38,545 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:38,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:38,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:38,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:38,547 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:38,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:38,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:38,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 23:54:38,631 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:38,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:54:38,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:54:38,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:54:38,633 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 3 states. [2018-01-24 23:54:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:38,797 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-01-24 23:54:38,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:54:38,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 23:54:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:38,799 INFO L225 Difference]: With dead ends: 103 [2018-01-24 23:54:38,799 INFO L226 Difference]: Without dead ends: 102 [2018-01-24 23:54:38,800 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:54:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-24 23:54:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-01-24 23:54:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-24 23:54:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-01-24 23:54:38,807 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 7 [2018-01-24 23:54:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:38,807 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-01-24 23:54:38,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:54:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-01-24 23:54:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:54:38,807 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:38,808 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:54:38,808 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:38,808 INFO L82 PathProgramCache]: Analyzing trace with hash -190938367, now seen corresponding path program 1 times [2018-01-24 23:54:38,808 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:38,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:38,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:38,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:38,809 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:38,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:38,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:38,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:54:38,908 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:38,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:54:38,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:54:38,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:54:38,909 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 5 states. [2018-01-24 23:54:39,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:39,063 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-01-24 23:54:39,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:54:39,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 23:54:39,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:39,065 INFO L225 Difference]: With dead ends: 100 [2018-01-24 23:54:39,065 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 23:54:39,065 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:54:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 23:54:39,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-01-24 23:54:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 23:54:39,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-24 23:54:39,072 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 14 [2018-01-24 23:54:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:39,072 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-24 23:54:39,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:54:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-24 23:54:39,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:54:39,073 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:39,073 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:54:39,073 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:39,073 INFO L82 PathProgramCache]: Analyzing trace with hash -190938366, now seen corresponding path program 1 times [2018-01-24 23:54:39,073 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:39,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:39,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:39,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:39,074 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:39,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:39,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:39,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:54:39,206 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:39,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:54:39,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:54:39,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:54:39,207 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 7 states. [2018-01-24 23:54:39,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:39,395 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-01-24 23:54:39,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:54:39,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-24 23:54:39,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:39,397 INFO L225 Difference]: With dead ends: 93 [2018-01-24 23:54:39,397 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 23:54:39,398 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:54:39,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 23:54:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-24 23:54:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 23:54:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-01-24 23:54:39,405 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 14 [2018-01-24 23:54:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:39,406 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-01-24 23:54:39,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:54:39,406 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-01-24 23:54:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 23:54:39,406 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:39,407 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:54:39,407 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:39,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1624122010, now seen corresponding path program 1 times [2018-01-24 23:54:39,407 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:39,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:39,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:39,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:39,408 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:39,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:39,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:39,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:54:39,465 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:39,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:54:39,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:54:39,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:54:39,466 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 4 states. [2018-01-24 23:54:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:39,546 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-01-24 23:54:39,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:54:39,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 23:54:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:39,547 INFO L225 Difference]: With dead ends: 84 [2018-01-24 23:54:39,547 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 23:54:39,548 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:54:39,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 23:54:39,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-24 23:54:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 23:54:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-01-24 23:54:39,553 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 15 [2018-01-24 23:54:39,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:39,553 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-01-24 23:54:39,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:54:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-01-24 23:54:39,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 23:54:39,554 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:39,554 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:54:39,554 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:39,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1624122009, now seen corresponding path program 1 times [2018-01-24 23:54:39,555 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:39,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:39,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:39,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:39,556 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:39,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:39,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:39,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:54:39,617 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:39,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:54:39,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:54:39,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:54:39,618 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 4 states. [2018-01-24 23:54:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:39,667 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-01-24 23:54:39,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:54:39,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 23:54:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:39,668 INFO L225 Difference]: With dead ends: 80 [2018-01-24 23:54:39,668 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 23:54:39,669 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:54:39,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 23:54:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-24 23:54:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 23:54:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-24 23:54:39,676 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2018-01-24 23:54:39,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:39,676 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-24 23:54:39,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:54:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-24 23:54:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 23:54:39,677 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:39,677 INFO L322 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-24 23:54:39,677 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:39,678 INFO L82 PathProgramCache]: Analyzing trace with hash 146058220, now seen corresponding path program 1 times [2018-01-24 23:54:39,678 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:39,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:39,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:39,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:39,679 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:39,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:39,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:39,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:54:39,783 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:39,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:54:39,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:54:39,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:54:39,784 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 8 states. [2018-01-24 23:54:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:40,021 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-01-24 23:54:40,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 23:54:40,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 23:54:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:40,023 INFO L225 Difference]: With dead ends: 159 [2018-01-24 23:54:40,023 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 23:54:40,024 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-01-24 23:54:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 23:54:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-01-24 23:54:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 23:54:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-01-24 23:54:40,031 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 20 [2018-01-24 23:54:40,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:40,032 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-01-24 23:54:40,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:54:40,032 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-01-24 23:54:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 23:54:40,034 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:40,034 INFO L322 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] [2018-01-24 23:54:40,034 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:40,035 INFO L82 PathProgramCache]: Analyzing trace with hash -892550082, now seen corresponding path program 1 times [2018-01-24 23:54:40,035 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:40,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:40,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:40,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:40,036 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:40,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:40,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:40,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:54:40,140 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:40,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:54:40,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:54:40,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:54:40,141 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 7 states. [2018-01-24 23:54:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:40,310 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-01-24 23:54:40,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:54:40,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 23:54:40,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:40,311 INFO L225 Difference]: With dead ends: 99 [2018-01-24 23:54:40,311 INFO L226 Difference]: Without dead ends: 98 [2018-01-24 23:54:40,312 INFO L525 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-24 23:54:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-24 23:54:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2018-01-24 23:54:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-24 23:54:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-24 23:54:40,319 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 31 [2018-01-24 23:54:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:40,319 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-24 23:54:40,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:54:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-24 23:54:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 23:54:40,320 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:40,320 INFO L322 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] [2018-01-24 23:54:40,321 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:40,321 INFO L82 PathProgramCache]: Analyzing trace with hash -892550081, now seen corresponding path program 1 times [2018-01-24 23:54:40,321 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:40,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:40,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:40,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:40,322 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:40,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:40,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:40,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:54:40,454 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:40,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:54:40,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:54:40,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:54:40,455 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 9 states. [2018-01-24 23:54:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:40,639 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-01-24 23:54:40,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 23:54:40,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-24 23:54:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:40,640 INFO L225 Difference]: With dead ends: 102 [2018-01-24 23:54:40,640 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 23:54:40,641 INFO L525 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-24 23:54:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 23:54:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 84. [2018-01-24 23:54:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 23:54:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-24 23:54:40,648 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 31 [2018-01-24 23:54:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:40,649 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-24 23:54:40,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:54:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-24 23:54:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 23:54:40,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:40,650 INFO L322 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] [2018-01-24 23:54:40,650 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:40,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1281554978, now seen corresponding path program 1 times [2018-01-24 23:54:40,651 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:40,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:40,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:40,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:40,652 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:40,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:40,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:40,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:54:40,688 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:40,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:54:40,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:54:40,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:54:40,688 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 3 states. [2018-01-24 23:54:40,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:40,728 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-01-24 23:54:40,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:54:40,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-01-24 23:54:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:40,729 INFO L225 Difference]: With dead ends: 107 [2018-01-24 23:54:40,729 INFO L226 Difference]: Without dead ends: 87 [2018-01-24 23:54:40,729 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:54:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-24 23:54:40,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-01-24 23:54:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 23:54:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-01-24 23:54:40,734 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 33 [2018-01-24 23:54:40,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:40,734 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-01-24 23:54:40,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:54:40,734 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-01-24 23:54:40,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 23:54:40,736 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:40,736 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:54:40,736 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash 183041674, now seen corresponding path program 1 times [2018-01-24 23:54:40,737 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:40,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:40,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:40,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:40,738 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:40,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:40,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:40,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:54:40,817 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:40,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:54:40,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:54:40,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:54:40,818 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 5 states. [2018-01-24 23:54:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:40,957 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-01-24 23:54:40,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:54:40,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-24 23:54:40,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:40,958 INFO L225 Difference]: With dead ends: 86 [2018-01-24 23:54:40,959 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 23:54:40,959 INFO L525 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-24 23:54:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 23:54:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-24 23:54:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-24 23:54:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-24 23:54:40,964 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 34 [2018-01-24 23:54:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:40,964 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-24 23:54:40,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:54:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-24 23:54:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 23:54:40,966 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:40,966 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:54:40,966 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:40,966 INFO L82 PathProgramCache]: Analyzing trace with hash 183041675, now seen corresponding path program 1 times [2018-01-24 23:54:40,966 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:40,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:40,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:40,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:40,968 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:40,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:41,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:41,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 23:54:41,201 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:41,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 23:54:41,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 23:54:41,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:54:41,202 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 11 states. [2018-01-24 23:54:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:41,398 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-01-24 23:54:41,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 23:54:41,398 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-01-24 23:54:41,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:41,402 INFO L225 Difference]: With dead ends: 88 [2018-01-24 23:54:41,402 INFO L226 Difference]: Without dead ends: 87 [2018-01-24 23:54:41,403 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-01-24 23:54:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-24 23:54:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-01-24 23:54:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 23:54:41,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-24 23:54:41,408 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 34 [2018-01-24 23:54:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:41,408 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-24 23:54:41,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 23:54:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-24 23:54:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 23:54:41,410 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:41,410 INFO L322 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] [2018-01-24 23:54:41,410 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:41,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1082481281, now seen corresponding path program 1 times [2018-01-24 23:54:41,411 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:41,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:41,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:41,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:41,412 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:41,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:41,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:41,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:54:41,462 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:41,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:54:41,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:54:41,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:54:41,463 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 4 states. [2018-01-24 23:54:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:41,553 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-01-24 23:54:41,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:54:41,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-24 23:54:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:41,554 INFO L225 Difference]: With dead ends: 90 [2018-01-24 23:54:41,554 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 23:54:41,555 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:54:41,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 23:54:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-01-24 23:54:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 23:54:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-01-24 23:54:41,559 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 35 [2018-01-24 23:54:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:41,559 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-01-24 23:54:41,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:54:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-01-24 23:54:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 23:54:41,560 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:41,560 INFO L322 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] [2018-01-24 23:54:41,560 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:41,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1379324610, now seen corresponding path program 1 times [2018-01-24 23:54:41,561 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:41,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:41,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:41,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:41,562 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:41,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:41,904 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 20 DAG size of output 17 [2018-01-24 23:54:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:42,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:42,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 23:54:42,122 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:42,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 23:54:42,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 23:54:42,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-24 23:54:42,123 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 15 states. [2018-01-24 23:54:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:42,731 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-01-24 23:54:42,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 23:54:42,732 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-01-24 23:54:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:42,734 INFO L225 Difference]: With dead ends: 115 [2018-01-24 23:54:42,734 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 23:54:42,734 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-01-24 23:54:42,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 23:54:42,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2018-01-24 23:54:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 23:54:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-01-24 23:54:42,743 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 35 [2018-01-24 23:54:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:42,743 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-01-24 23:54:42,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 23:54:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-01-24 23:54:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 23:54:42,744 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:42,744 INFO L322 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] [2018-01-24 23:54:42,744 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:42,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1379324611, now seen corresponding path program 1 times [2018-01-24 23:54:42,745 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:42,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:42,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:42,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:42,747 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:42,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:43,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:43,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 23:54:43,089 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:43,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 23:54:43,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 23:54:43,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-24 23:54:43,090 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 15 states. [2018-01-24 23:54:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:43,565 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-01-24 23:54:43,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 23:54:43,581 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-01-24 23:54:43,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:43,582 INFO L225 Difference]: With dead ends: 105 [2018-01-24 23:54:43,582 INFO L226 Difference]: Without dead ends: 104 [2018-01-24 23:54:43,583 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-01-24 23:54:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-24 23:54:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-01-24 23:54:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 23:54:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-01-24 23:54:43,589 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 35 [2018-01-24 23:54:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:43,589 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-01-24 23:54:43,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 23:54:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-01-24 23:54:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 23:54:43,590 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:43,590 INFO L322 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] [2018-01-24 23:54:43,590 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:43,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1613943773, now seen corresponding path program 1 times [2018-01-24 23:54:43,590 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:43,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:43,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:43,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:43,591 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:43,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:43,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:43,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 23:54:43,973 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:43,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 23:54:43,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 23:54:43,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-24 23:54:43,974 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 17 states. [2018-01-24 23:54:44,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:44,562 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-01-24 23:54:44,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 23:54:44,562 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-01-24 23:54:44,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:44,563 INFO L225 Difference]: With dead ends: 122 [2018-01-24 23:54:44,563 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 23:54:44,563 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2018-01-24 23:54:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 23:54:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-01-24 23:54:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 23:54:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-01-24 23:54:44,570 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 37 [2018-01-24 23:54:44,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:44,571 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-01-24 23:54:44,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 23:54:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-01-24 23:54:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 23:54:44,571 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:44,572 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:54:44,572 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:44,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1507350608, now seen corresponding path program 1 times [2018-01-24 23:54:44,572 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:44,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:44,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:44,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:44,573 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:44,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:44,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:44,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:54:44,654 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:44,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:54:44,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:54:44,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:54:44,654 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 8 states. [2018-01-24 23:54:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:44,754 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-01-24 23:54:44,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:54:44,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-24 23:54:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:44,755 INFO L225 Difference]: With dead ends: 109 [2018-01-24 23:54:44,755 INFO L226 Difference]: Without dead ends: 108 [2018-01-24 23:54:44,756 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 23:54:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-24 23:54:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-01-24 23:54:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-24 23:54:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-01-24 23:54:44,761 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 38 [2018-01-24 23:54:44,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:44,761 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-01-24 23:54:44,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:54:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-01-24 23:54:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 23:54:44,762 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:44,763 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:54:44,763 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:44,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1507350609, now seen corresponding path program 1 times [2018-01-24 23:54:44,763 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:44,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:44,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:44,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:44,764 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:44,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:54:45,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:54:45,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 23:54:45,200 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:54:45,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 23:54:45,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 23:54:45,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-24 23:54:45,201 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 15 states. [2018-01-24 23:54:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:54:46,014 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-01-24 23:54:46,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 23:54:46,014 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-01-24 23:54:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:54:46,015 INFO L225 Difference]: With dead ends: 119 [2018-01-24 23:54:46,015 INFO L226 Difference]: Without dead ends: 118 [2018-01-24 23:54:46,015 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-01-24 23:54:46,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-24 23:54:46,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2018-01-24 23:54:46,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 23:54:46,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-01-24 23:54:46,021 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 38 [2018-01-24 23:54:46,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:54:46,021 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-01-24 23:54:46,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 23:54:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-01-24 23:54:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 23:54:46,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:54:46,022 INFO L322 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] [2018-01-24 23:54:46,022 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 23:54:46,022 INFO L82 PathProgramCache]: Analyzing trace with hash 563388428, now seen corresponding path program 1 times [2018-01-24 23:54:46,022 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:54:46,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:46,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:54:46,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:54:46,023 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:54:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:54:46,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:54:46,178 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-24 23:54:46,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:54:46,179 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:54:46,179 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-01-24 23:54:46,180 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [13], [15], [17], [22], [95], [96], [97], [98], [101], [104], [105], [110], [111], [115], [119], [120], [121], [123], [126], [127], [130], [131], [132], [133], [135], [136] [2018-01-24 23:54:46,225 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:54:46,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 23:55:36,610 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 23:55:36,611 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 23:55:36,612 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 23:55:36,612 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:55:36,612 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:55:36,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:55:36,620 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:55:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:55:36,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:55:36,680 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 23:55:36,681 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 23:55:36,686 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 23:55:36,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:55:36 BoogieIcfgContainer [2018-01-24 23:55:36,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:55:36,687 INFO L168 Benchmark]: Toolchain (without parser) took 59486.61 ms. Allocated memory was 306.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 266.8 MB in the beginning and 466.8 MB in the end (delta: -200.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-24 23:55:36,688 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:55:36,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.22 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 255.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:55:36,689 INFO L168 Benchmark]: Boogie Preprocessor took 37.42 ms. Allocated memory is still 306.7 MB. Free memory was 254.8 MB in the beginning and 253.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 23:55:36,689 INFO L168 Benchmark]: RCFGBuilder took 440.51 ms. Allocated memory is still 306.7 MB. Free memory was 253.8 MB in the beginning and 225.9 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-01-24 23:55:36,690 INFO L168 Benchmark]: TraceAbstraction took 58785.93 ms. Allocated memory was 306.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 225.9 MB in the beginning and 466.8 MB in the end (delta: -240.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-24 23:55:36,691 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.12 ms. Allocated memory is still 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.22 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 255.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.42 ms. Allocated memory is still 306.7 MB. Free memory was 254.8 MB in the beginning and 253.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 440.51 ms. Allocated memory is still 306.7 MB. Free memory was 253.8 MB in the beginning and 225.9 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58785.93 ms. Allocated memory was 306.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 225.9 MB in the beginning and 466.8 MB in the end (delta: -240.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 43 error locations. TIMEOUT Result, 58.7s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1132 SDtfs, 1122 SDslu, 2935 SDs, 0 SdLazy, 2975 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 50.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 95 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 134254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_23-55-36-700.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_23-55-36-700.csv Completed graceful shutdown