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_preciseopt.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:09:23,775 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:09:23,777 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:09:23,793 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:09:23,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:09:23,794 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:09:23,796 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:09:23,797 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:09:23,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:09:23,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:09:23,801 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:09:23,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:09:23,802 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:09:23,804 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:09:23,805 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:09:23,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:09:23,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:09:23,811 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:09:23,813 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:09:23,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:09:23,816 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:09:23,817 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:09:23,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:09:23,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:09:23,819 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:09:23,820 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:09:23,820 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:09:23,821 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:09:23,821 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:09:23,821 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:09:23,822 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:09:23,822 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_preciseopt.epf [2018-01-25 03:09:23,831 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:09:23,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:09:23,832 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:09:23,832 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:09:23,832 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:09:23,832 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:09:23,832 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:09:23,832 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:09:23,832 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:09:23,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:09:23,833 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:09:23,833 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:09:23,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:09:23,834 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:09:23,834 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:09:23,834 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:09:23,834 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:09:23,834 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:09:23,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:09:23,834 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:09:23,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:09:23,835 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:09:23,835 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:09:23,835 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:09:23,835 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:09:23,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:09:23,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:09:23,836 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:09:23,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:09:23,836 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:09:23,836 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:09:23,836 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:09:23,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:09:23,837 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:09:23,837 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:09:23,837 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:09:23,837 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:09:23,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:09:23,886 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:09:23,893 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:09:23,895 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:09:23,896 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:09:23,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05_false-valid-deref.i [2018-01-25 03:09:24,203 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:09:24,210 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:09:24,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:09:24,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:09:24,217 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:09:24,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:09:24" (1/1) ... [2018-01-25 03:09:24,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d17d7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:09:24, skipping insertion in model container [2018-01-25 03:09:24,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:09:24" (1/1) ... [2018-01-25 03:09:24,236 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:09:24,278 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:09:24,415 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:09:24,445 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:09:24,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:09:24 WrapperNode [2018-01-25 03:09:24,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:09:24,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:09:24,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:09:24,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:09:24,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:09:24" (1/1) ... [2018-01-25 03:09:24,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:09:24" (1/1) ... [2018-01-25 03:09:24,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:09:24" (1/1) ... [2018-01-25 03:09:24,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:09:24" (1/1) ... [2018-01-25 03:09:24,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:09:24" (1/1) ... [2018-01-25 03:09:24,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:09:24" (1/1) ... [2018-01-25 03:09:24,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:09:24" (1/1) ... [2018-01-25 03:09:24,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:09:24,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:09:24,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:09:24,512 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:09:24,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:09:24" (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-25 03:09:24,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:09:24,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:09:24,570 INFO L136 BoogieDeclarations]: Found implementation of procedure containsHead [2018-01-25 03:09:24,570 INFO L136 BoogieDeclarations]: Found implementation of procedure containsBody [2018-01-25 03:09:24,570 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-25 03:09:24,570 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:09:24,570 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:09:24,571 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:09:24,571 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:09:24,571 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:09:24,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:09:24,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:09:24,571 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:09:24,571 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:09:24,571 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-01-25 03:09:24,571 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:09:24,572 INFO L128 BoogieDeclarations]: Found specification of procedure containsHead [2018-01-25 03:09:24,572 INFO L128 BoogieDeclarations]: Found specification of procedure containsBody [2018-01-25 03:09:24,572 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-25 03:09:24,572 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:09:24,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:09:24,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:09:25,587 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:09:25,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:09:25 BoogieIcfgContainer [2018-01-25 03:09:25,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:09:25,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:09:25,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:09:25,591 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:09:25,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:09:24" (1/3) ... [2018-01-25 03:09:25,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d0629f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:09:25, skipping insertion in model container [2018-01-25 03:09:25,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:09:24" (2/3) ... [2018-01-25 03:09:25,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d0629f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:09:25, skipping insertion in model container [2018-01-25 03:09:25,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:09:25" (3/3) ... [2018-01-25 03:09:25,594 INFO L105 eAbstractionObserver]: Analyzing ICFG split_list_test05_false-valid-deref.i [2018-01-25 03:09:25,602 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:09:25,609 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 141 error locations. [2018-01-25 03:09:25,666 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:09:25,666 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:09:25,667 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:09:25,667 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:09:25,667 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:09:25,667 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:09:25,667 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:09:25,667 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:09:25,668 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:09:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states. [2018-01-25 03:09:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 03:09:25,708 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:09:25,709 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:09:25,710 INFO L371 AbstractCegarLoop]: === Iteration 1 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 03:09:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash 479486545, now seen corresponding path program 1 times [2018-01-25 03:09:25,719 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:09:25,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:25,783 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:09:25,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:25,783 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:09:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:09:25,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:09:25,935 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-25 03:09:25,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:09:25,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:09:25,938 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:09:26,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:09:26,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:09:26,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:09:26,047 INFO L87 Difference]: Start difference. First operand 332 states. Second operand 4 states. [2018-01-25 03:09:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:09:26,758 INFO L93 Difference]: Finished difference Result 707 states and 818 transitions. [2018-01-25 03:09:26,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:09:26,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 03:09:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:09:26,773 INFO L225 Difference]: With dead ends: 707 [2018-01-25 03:09:26,774 INFO L226 Difference]: Without dead ends: 384 [2018-01-25 03:09:26,779 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-25 03:09:26,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-01-25 03:09:26,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 344. [2018-01-25 03:09:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-01-25 03:09:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 388 transitions. [2018-01-25 03:09:26,836 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 388 transitions. Word has length 8 [2018-01-25 03:09:26,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:09:26,839 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 388 transitions. [2018-01-25 03:09:26,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:09:26,839 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 388 transitions. [2018-01-25 03:09:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 03:09:26,840 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:09:26,840 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:09:26,843 INFO L371 AbstractCegarLoop]: === Iteration 2 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 03:09:26,844 INFO L82 PathProgramCache]: Analyzing trace with hash 479486546, now seen corresponding path program 1 times [2018-01-25 03:09:26,844 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:09:26,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:26,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:09:26,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:26,846 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:09:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:09:26,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:09:26,944 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-25 03:09:26,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:09:26,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:09:26,945 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:09:26,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:09:26,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:09:26,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:09:26,947 INFO L87 Difference]: Start difference. First operand 344 states and 388 transitions. Second operand 4 states. [2018-01-25 03:09:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:09:27,181 INFO L93 Difference]: Finished difference Result 348 states and 394 transitions. [2018-01-25 03:09:27,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:09:27,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 03:09:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:09:27,184 INFO L225 Difference]: With dead ends: 348 [2018-01-25 03:09:27,184 INFO L226 Difference]: Without dead ends: 346 [2018-01-25 03:09:27,185 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-25 03:09:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-01-25 03:09:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2018-01-25 03:09:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-01-25 03:09:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 386 transitions. [2018-01-25 03:09:27,207 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 386 transitions. Word has length 8 [2018-01-25 03:09:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:09:27,208 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 386 transitions. [2018-01-25 03:09:27,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:09:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 386 transitions. [2018-01-25 03:09:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 03:09:27,209 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:09:27,209 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:09:27,209 INFO L371 AbstractCegarLoop]: === Iteration 3 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 03:09:27,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2063719306, now seen corresponding path program 1 times [2018-01-25 03:09:27,209 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:09:27,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:27,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:09:27,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:27,211 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:09:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:09:27,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:09:27,280 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-25 03:09:27,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:09:27,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:09:27,284 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:09:27,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:09:27,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:09:27,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:09:27,285 INFO L87 Difference]: Start difference. First operand 342 states and 386 transitions. Second operand 4 states. [2018-01-25 03:09:27,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:09:27,649 INFO L93 Difference]: Finished difference Result 342 states and 386 transitions. [2018-01-25 03:09:27,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:09:27,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-25 03:09:27,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:09:27,652 INFO L225 Difference]: With dead ends: 342 [2018-01-25 03:09:27,653 INFO L226 Difference]: Without dead ends: 337 [2018-01-25 03:09:27,653 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-25 03:09:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-01-25 03:09:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-01-25 03:09:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-01-25 03:09:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 381 transitions. [2018-01-25 03:09:27,674 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 381 transitions. Word has length 18 [2018-01-25 03:09:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:09:27,675 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 381 transitions. [2018-01-25 03:09:27,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:09:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 381 transitions. [2018-01-25 03:09:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 03:09:27,676 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:09:27,676 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:09:27,676 INFO L371 AbstractCegarLoop]: === Iteration 4 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 03:09:27,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2063719305, now seen corresponding path program 1 times [2018-01-25 03:09:27,677 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:09:27,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:27,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:09:27,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:27,678 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:09:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:09:27,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:09:27,768 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-25 03:09:27,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:09:27,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:09:27,769 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:09:27,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:09:27,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:09:27,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:09:27,770 INFO L87 Difference]: Start difference. First operand 337 states and 381 transitions. Second operand 4 states. [2018-01-25 03:09:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:09:28,000 INFO L93 Difference]: Finished difference Result 337 states and 381 transitions. [2018-01-25 03:09:28,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:09:28,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-25 03:09:28,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:09:28,003 INFO L225 Difference]: With dead ends: 337 [2018-01-25 03:09:28,003 INFO L226 Difference]: Without dead ends: 332 [2018-01-25 03:09:28,003 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-25 03:09:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-01-25 03:09:28,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2018-01-25 03:09:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-01-25 03:09:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 376 transitions. [2018-01-25 03:09:28,016 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 376 transitions. Word has length 18 [2018-01-25 03:09:28,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:09:28,016 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 376 transitions. [2018-01-25 03:09:28,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:09:28,016 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 376 transitions. [2018-01-25 03:09:28,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:09:28,017 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:09:28,017 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:09:28,017 INFO L371 AbstractCegarLoop]: === Iteration 5 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 03:09:28,018 INFO L82 PathProgramCache]: Analyzing trace with hash 449211379, now seen corresponding path program 1 times [2018-01-25 03:09:28,018 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:09:28,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:28,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:09:28,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:28,019 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:09:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:09:28,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:09:28,127 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-25 03:09:28,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:09:28,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:09:28,128 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:09:28,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:09:28,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:09:28,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:09:28,129 INFO L87 Difference]: Start difference. First operand 332 states and 376 transitions. Second operand 7 states. [2018-01-25 03:09:29,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:09:29,225 INFO L93 Difference]: Finished difference Result 368 states and 411 transitions. [2018-01-25 03:09:29,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:09:29,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-25 03:09:29,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:09:29,229 INFO L225 Difference]: With dead ends: 368 [2018-01-25 03:09:29,229 INFO L226 Difference]: Without dead ends: 360 [2018-01-25 03:09:29,229 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:09:29,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-01-25 03:09:29,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 324. [2018-01-25 03:09:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-01-25 03:09:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 368 transitions. [2018-01-25 03:09:29,245 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 368 transitions. Word has length 19 [2018-01-25 03:09:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:09:29,245 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 368 transitions. [2018-01-25 03:09:29,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:09:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 368 transitions. [2018-01-25 03:09:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:09:29,246 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:09:29,246 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:09:29,247 INFO L371 AbstractCegarLoop]: === Iteration 6 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 03:09:29,247 INFO L82 PathProgramCache]: Analyzing trace with hash 449211380, now seen corresponding path program 1 times [2018-01-25 03:09:29,247 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:09:29,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:29,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:09:29,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:29,250 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:09:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:09:29,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:09:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:09:29,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:09:29,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:09:29,420 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:09:29,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:09:29,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:09:29,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:09:29,421 INFO L87 Difference]: Start difference. First operand 324 states and 368 transitions. Second operand 8 states. [2018-01-25 03:09:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:09:30,090 INFO L93 Difference]: Finished difference Result 363 states and 409 transitions. [2018-01-25 03:09:30,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:09:30,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 03:09:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:09:30,093 INFO L225 Difference]: With dead ends: 363 [2018-01-25 03:09:30,093 INFO L226 Difference]: Without dead ends: 354 [2018-01-25 03:09:30,094 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:09:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-01-25 03:09:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 315. [2018-01-25 03:09:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-01-25 03:09:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 358 transitions. [2018-01-25 03:09:30,107 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 358 transitions. Word has length 19 [2018-01-25 03:09:30,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:09:30,107 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 358 transitions. [2018-01-25 03:09:30,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:09:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 358 transitions. [2018-01-25 03:09:30,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:09:30,109 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:09:30,109 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] [2018-01-25 03:09:30,109 INFO L371 AbstractCegarLoop]: === Iteration 7 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 03:09:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1619802097, now seen corresponding path program 1 times [2018-01-25 03:09:30,109 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:09:30,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:30,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:09:30,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:30,111 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:09:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:09:30,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:09:30,323 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-25 03:09:30,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:09:30,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:09:30,324 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:09:30,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:09:30,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:09:30,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:09:30,325 INFO L87 Difference]: Start difference. First operand 315 states and 358 transitions. Second operand 9 states. [2018-01-25 03:09:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:09:30,836 INFO L93 Difference]: Finished difference Result 643 states and 734 transitions. [2018-01-25 03:09:30,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:09:30,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-25 03:09:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:09:30,838 INFO L225 Difference]: With dead ends: 643 [2018-01-25 03:09:30,839 INFO L226 Difference]: Without dead ends: 338 [2018-01-25 03:09:30,840 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-01-25 03:09:30,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-01-25 03:09:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 326. [2018-01-25 03:09:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-01-25 03:09:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 371 transitions. [2018-01-25 03:09:30,858 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 371 transitions. Word has length 28 [2018-01-25 03:09:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:09:30,859 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 371 transitions. [2018-01-25 03:09:30,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:09:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 371 transitions. [2018-01-25 03:09:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:09:30,860 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:09:30,860 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] [2018-01-25 03:09:30,860 INFO L371 AbstractCegarLoop]: === Iteration 8 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 03:09:30,860 INFO L82 PathProgramCache]: Analyzing trace with hash -82034476, now seen corresponding path program 1 times [2018-01-25 03:09:30,861 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:09:30,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:30,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:09:30,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:30,862 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:09:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:09:30,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:09:31,143 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-25 03:09:31,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:09:31,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 03:09:31,144 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:09:31,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 03:09:31,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 03:09:31,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:09:31,145 INFO L87 Difference]: Start difference. First operand 326 states and 371 transitions. Second operand 13 states. [2018-01-25 03:09:32,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:09:32,252 INFO L93 Difference]: Finished difference Result 671 states and 761 transitions. [2018-01-25 03:09:32,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 03:09:32,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-01-25 03:09:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:09:32,255 INFO L225 Difference]: With dead ends: 671 [2018-01-25 03:09:32,255 INFO L226 Difference]: Without dead ends: 366 [2018-01-25 03:09:32,257 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-01-25 03:09:32,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-01-25 03:09:32,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2018-01-25 03:09:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-01-25 03:09:32,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 374 transitions. [2018-01-25 03:09:32,273 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 374 transitions. Word has length 30 [2018-01-25 03:09:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:09:32,274 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 374 transitions. [2018-01-25 03:09:32,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 03:09:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 374 transitions. [2018-01-25 03:09:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-25 03:09:32,275 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:09:32,276 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:09:32,276 INFO L371 AbstractCegarLoop]: === Iteration 9 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-25 03:09:32,276 INFO L82 PathProgramCache]: Analyzing trace with hash -156377040, now seen corresponding path program 1 times [2018-01-25 03:09:32,276 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:09:32,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:32,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:09:32,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:09:32,278 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:09:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:09:32,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:09:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:09:33,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:09:33,104 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:09:33,105 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-01-25 03:09:33,107 INFO L201 CegarAbsIntRunner]: [106], [107], [108], [111], [114], [118], [122], [126], [134], [137], [338], [339], [449], [450], [451], [452], [455], [458], [461], [462], [465], [467], [471], [472], [475], [478], [481], [484], [485], [488], [491], [492], [495], [499], [505], [506], [507], [508], [538], [539], [540] [2018-01-25 03:09:33,154 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:09:33,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 03:10:22,805 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 03:10:22,806 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 03:10:22,807 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:10:22,807 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:10:22,807 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-25 03:10:22,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:10:22,814 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:10:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:10:22,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:10:22,898 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 03:10:22,899 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 03:10:22,908 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 03:10:22,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:10:22 BoogieIcfgContainer [2018-01-25 03:10:22,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:10:22,910 INFO L168 Benchmark]: Toolchain (without parser) took 58706.47 ms. Allocated memory was 308.8 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 266.7 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 251.5 MB. Max. memory is 5.3 GB. [2018-01-25 03:10:22,912 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 308.8 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:10:22,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.77 ms. Allocated memory is still 308.8 MB. Free memory was 265.7 MB in the beginning and 253.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:10:22,913 INFO L168 Benchmark]: Boogie Preprocessor took 50.61 ms. Allocated memory is still 308.8 MB. Free memory was 253.8 MB in the beginning and 250.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:10:22,913 INFO L168 Benchmark]: RCFGBuilder took 1076.01 ms. Allocated memory was 308.8 MB in the beginning and 326.1 MB in the end (delta: 17.3 MB). Free memory was 250.8 MB in the beginning and 282.3 MB in the end (delta: -31.5 MB). Peak memory consumption was 71.4 MB. Max. memory is 5.3 GB. [2018-01-25 03:10:22,913 INFO L168 Benchmark]: TraceAbstraction took 57320.05 ms. Allocated memory was 326.1 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 282.3 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 249.8 MB. Max. memory is 5.3 GB. [2018-01-25 03:10:22,916 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.19 ms. Allocated memory is still 308.8 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 249.77 ms. Allocated memory is still 308.8 MB. Free memory was 265.7 MB in the beginning and 253.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 50.61 ms. Allocated memory is still 308.8 MB. Free memory was 253.8 MB in the beginning and 250.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1076.01 ms. Allocated memory was 308.8 MB in the beginning and 326.1 MB in the end (delta: 17.3 MB). Free memory was 250.8 MB in the beginning and 282.3 MB in the end (delta: -31.5 MB). Peak memory consumption was 71.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57320.05 ms. Allocated memory was 326.1 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 282.3 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 249.8 MB. 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 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 611). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 617). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 621). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 612). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 616). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 611). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 617). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 616). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 602). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 621). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 603). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 602). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 603). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 612). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 332 locations, 141 error locations. TIMEOUT Result, 57.2s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2530 SDtfs, 1121 SDslu, 7189 SDs, 0 SdLazy, 4089 SolverSat, 193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 49.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 168 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 24909 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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/split_list_test05_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-10-22-931.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-10-22-931.csv Completed graceful shutdown