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_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:49:40,453 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:49:40,456 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:49:40,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:49:40,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:49:40,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:49:40,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:49:40,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:49:40,476 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:49:40,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:49:40,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:49:40,477 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:49:40,478 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:49:40,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:49:40,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:49:40,481 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:49:40,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:49:40,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:49:40,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:49:40,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:49:40,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:49:40,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:49:40,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:49:40,492 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:49:40,492 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:49:40,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:49:40,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:49:40,494 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:49:40,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:49:40,495 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:49:40,495 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:49:40,496 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_smtcomp.epf [2018-01-25 05:49:40,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:49:40,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:49:40,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:49:40,507 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:49:40,507 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:49:40,507 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:49:40,507 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:49:40,508 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:49:40,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:49:40,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:49:40,509 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:49:40,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:49:40,509 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:49:40,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:49:40,509 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:49:40,510 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:49:40,510 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:49:40,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:49:40,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:49:40,510 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:49:40,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:49:40,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:49:40,511 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:49:40,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:49:40,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:49:40,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:49:40,512 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:49:40,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:49:40,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:49:40,512 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:49:40,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:49:40,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:49:40,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:49:40,513 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:49:40,514 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:49:40,514 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:49:40,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:49:40,560 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:49:40,564 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:49:40,565 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:49:40,566 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:49:40,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i [2018-01-25 05:49:40,746 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:49:40,751 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:49:40,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:49:40,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:49:40,757 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:49:40,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:49:40" (1/1) ... [2018-01-25 05:49:40,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bda4018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:49:40, skipping insertion in model container [2018-01-25 05:49:40,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:49:40" (1/1) ... [2018-01-25 05:49:40,773 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:49:40,811 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:49:40,932 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:49:40,960 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:49:40,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:49:40 WrapperNode [2018-01-25 05:49:40,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:49:40,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:49:40,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:49:40,973 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:49:40,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:49:40" (1/1) ... [2018-01-25 05:49:40,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:49:40" (1/1) ... [2018-01-25 05:49:40,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:49:40" (1/1) ... [2018-01-25 05:49:40,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:49:40" (1/1) ... [2018-01-25 05:49:41,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:49:40" (1/1) ... [2018-01-25 05:49:41,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:49:40" (1/1) ... [2018-01-25 05:49:41,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:49:40" (1/1) ... [2018-01-25 05:49:41,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:49:41,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:49:41,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:49:41,018 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:49:41,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:49:40" (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 05:49:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:49:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:49:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-25 05:49:41,069 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-25 05:49:41,070 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-25 05:49:41,070 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:49:41,070 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:49:41,070 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:49:41,070 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:49:41,070 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:49:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:49:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:49:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:49:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:49:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:49:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:49:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-25 05:49:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-25 05:49:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-25 05:49:41,071 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:49:41,072 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:49:41,072 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:49:41,709 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:49:41,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:49:41 BoogieIcfgContainer [2018-01-25 05:49:41,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:49:41,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:49:41,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:49:41,713 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:49:41,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:49:40" (1/3) ... [2018-01-25 05:49:41,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767cb8bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:49:41, skipping insertion in model container [2018-01-25 05:49:41,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:49:40" (2/3) ... [2018-01-25 05:49:41,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767cb8bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:49:41, skipping insertion in model container [2018-01-25 05:49:41,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:49:41" (3/3) ... [2018-01-25 05:49:41,717 INFO L105 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02_false-valid-memtrack.i [2018-01-25 05:49:41,726 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:49:41,733 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-01-25 05:49:41,784 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:49:41,784 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:49:41,785 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:49:41,785 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:49:41,785 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:49:41,785 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:49:41,785 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:49:41,785 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:49:41,786 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:49:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-25 05:49:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 05:49:41,817 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:49:41,818 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:49:41,818 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:49:41,823 INFO L82 PathProgramCache]: Analyzing trace with hash 573466511, now seen corresponding path program 1 times [2018-01-25 05:49:41,825 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:49:41,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:41,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:49:41,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:41,868 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:49:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:49:41,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:49:41,952 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 05:49:41,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:49:41,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:49:41,974 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:49:41,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:49:42,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:49:42,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:49:42,080 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 3 states. [2018-01-25 05:49:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:49:42,361 INFO L93 Difference]: Finished difference Result 416 states and 457 transitions. [2018-01-25 05:49:42,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:49:42,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 05:49:42,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:49:42,376 INFO L225 Difference]: With dead ends: 416 [2018-01-25 05:49:42,377 INFO L226 Difference]: Without dead ends: 207 [2018-01-25 05:49:42,383 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:49:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-25 05:49:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-01-25 05:49:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-01-25 05:49:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 219 transitions. [2018-01-25 05:49:42,439 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 219 transitions. Word has length 7 [2018-01-25 05:49:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:49:42,439 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 219 transitions. [2018-01-25 05:49:42,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:49:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 219 transitions. [2018-01-25 05:49:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 05:49:42,440 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:49:42,440 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:49:42,440 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:49:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash 573466512, now seen corresponding path program 1 times [2018-01-25 05:49:42,441 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:49:42,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:42,442 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:49:42,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:42,442 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:49:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:49:42,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:49:42,521 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 05:49:42,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:49:42,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:49:42,521 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:49:42,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:49:42,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:49:42,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:49:42,523 INFO L87 Difference]: Start difference. First operand 207 states and 219 transitions. Second operand 3 states. [2018-01-25 05:49:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:49:42,675 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2018-01-25 05:49:42,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:49:42,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 05:49:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:49:42,680 INFO L225 Difference]: With dead ends: 209 [2018-01-25 05:49:42,680 INFO L226 Difference]: Without dead ends: 208 [2018-01-25 05:49:42,681 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:49:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-01-25 05:49:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2018-01-25 05:49:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-25 05:49:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 218 transitions. [2018-01-25 05:49:42,699 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 218 transitions. Word has length 7 [2018-01-25 05:49:42,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:49:42,700 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 218 transitions. [2018-01-25 05:49:42,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:49:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 218 transitions. [2018-01-25 05:49:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:49:42,700 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:49:42,701 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:49:42,701 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:49:42,701 INFO L82 PathProgramCache]: Analyzing trace with hash -975144455, now seen corresponding path program 1 times [2018-01-25 05:49:42,701 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:49:42,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:42,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:49:42,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:42,702 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:49:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:49:42,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:49:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:49:42,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:49:42,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:49:42,798 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:49:42,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:49:42,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:49:42,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:49:42,799 INFO L87 Difference]: Start difference. First operand 206 states and 218 transitions. Second operand 5 states. [2018-01-25 05:49:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:49:43,100 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2018-01-25 05:49:43,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:49:43,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:49:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:49:43,122 INFO L225 Difference]: With dead ends: 206 [2018-01-25 05:49:43,122 INFO L226 Difference]: Without dead ends: 204 [2018-01-25 05:49:43,123 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:49:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-25 05:49:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-01-25 05:49:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-25 05:49:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions. [2018-01-25 05:49:43,136 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 14 [2018-01-25 05:49:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:49:43,136 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions. [2018-01-25 05:49:43,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:49:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions. [2018-01-25 05:49:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:49:43,137 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:49:43,138 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:49:43,138 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:49:43,139 INFO L82 PathProgramCache]: Analyzing trace with hash -975144454, now seen corresponding path program 1 times [2018-01-25 05:49:43,139 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:49:43,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:43,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:49:43,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:43,140 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:49:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:49:43,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:49:43,248 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 05:49:43,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:49:43,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:49:43,249 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:49:43,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:49:43,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:49:43,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:49:43,250 INFO L87 Difference]: Start difference. First operand 204 states and 216 transitions. Second operand 7 states. [2018-01-25 05:49:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:49:43,598 INFO L93 Difference]: Finished difference Result 226 states and 242 transitions. [2018-01-25 05:49:43,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:49:43,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-25 05:49:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:49:43,601 INFO L225 Difference]: With dead ends: 226 [2018-01-25 05:49:43,601 INFO L226 Difference]: Without dead ends: 224 [2018-01-25 05:49:43,602 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:49:43,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-25 05:49:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 213. [2018-01-25 05:49:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-25 05:49:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 228 transitions. [2018-01-25 05:49:43,623 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 228 transitions. Word has length 14 [2018-01-25 05:49:43,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:49:43,623 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 228 transitions. [2018-01-25 05:49:43,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:49:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 228 transitions. [2018-01-25 05:49:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:49:43,624 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:49:43,624 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:49:43,624 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:49:43,625 INFO L82 PathProgramCache]: Analyzing trace with hash -164706800, now seen corresponding path program 1 times [2018-01-25 05:49:43,625 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:49:43,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:43,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:49:43,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:43,626 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:49:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:49:43,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:49:43,670 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 05:49:43,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:49:43,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:49:43,671 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:49:43,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:49:43,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:49:43,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:49:43,672 INFO L87 Difference]: Start difference. First operand 213 states and 228 transitions. Second operand 4 states. [2018-01-25 05:49:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:49:43,849 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2018-01-25 05:49:43,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:49:43,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 05:49:43,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:49:43,851 INFO L225 Difference]: With dead ends: 213 [2018-01-25 05:49:43,851 INFO L226 Difference]: Without dead ends: 211 [2018-01-25 05:49:43,852 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 05:49:43,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-25 05:49:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-01-25 05:49:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-25 05:49:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 225 transitions. [2018-01-25 05:49:43,862 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 225 transitions. Word has length 15 [2018-01-25 05:49:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:49:43,863 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 225 transitions. [2018-01-25 05:49:43,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:49:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 225 transitions. [2018-01-25 05:49:43,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:49:43,864 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:49:43,864 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:49:43,864 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:49:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash -164706799, now seen corresponding path program 1 times [2018-01-25 05:49:43,864 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:49:43,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:43,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:49:43,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:43,866 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:49:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:49:43,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:49:43,928 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 05:49:43,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:49:43,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:49:43,928 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:49:43,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:49:43,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:49:43,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:49:43,929 INFO L87 Difference]: Start difference. First operand 211 states and 225 transitions. Second operand 4 states. [2018-01-25 05:49:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:49:44,061 INFO L93 Difference]: Finished difference Result 211 states and 225 transitions. [2018-01-25 05:49:44,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:49:44,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 05:49:44,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:49:44,063 INFO L225 Difference]: With dead ends: 211 [2018-01-25 05:49:44,063 INFO L226 Difference]: Without dead ends: 209 [2018-01-25 05:49:44,064 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 05:49:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-25 05:49:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-01-25 05:49:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-25 05:49:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 222 transitions. [2018-01-25 05:49:44,072 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 222 transitions. Word has length 15 [2018-01-25 05:49:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:49:44,072 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 222 transitions. [2018-01-25 05:49:44,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:49:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 222 transitions. [2018-01-25 05:49:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:49:44,073 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:49:44,073 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:49:44,073 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:49:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1093160757, now seen corresponding path program 1 times [2018-01-25 05:49:44,073 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:49:44,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:44,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:49:44,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:44,074 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:49:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:49:44,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:49:44,359 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 05:49:44,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:49:44,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 05:49:44,360 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:49:44,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:49:44,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:49:44,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:49:44,361 INFO L87 Difference]: Start difference. First operand 209 states and 222 transitions. Second operand 13 states. [2018-01-25 05:49:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:49:45,441 INFO L93 Difference]: Finished difference Result 403 states and 431 transitions. [2018-01-25 05:49:45,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:49:45,442 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-01-25 05:49:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:49:45,443 INFO L225 Difference]: With dead ends: 403 [2018-01-25 05:49:45,443 INFO L226 Difference]: Without dead ends: 211 [2018-01-25 05:49:45,445 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:49:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-25 05:49:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-01-25 05:49:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-25 05:49:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2018-01-25 05:49:45,457 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 20 [2018-01-25 05:49:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:49:45,458 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2018-01-25 05:49:45,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:49:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2018-01-25 05:49:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:49:45,459 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:49:45,459 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] [2018-01-25 05:49:45,459 INFO L371 AbstractCegarLoop]: === Iteration 8 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:49:45,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1733477554, now seen corresponding path program 1 times [2018-01-25 05:49:45,459 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:49:45,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:45,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:49:45,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:45,461 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:49:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:49:45,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:49:45,511 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 05:49:45,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:49:45,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:49:45,512 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:49:45,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:49:45,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:49:45,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:49:45,513 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand 4 states. [2018-01-25 05:49:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:49:45,549 INFO L93 Difference]: Finished difference Result 490 states and 526 transitions. [2018-01-25 05:49:45,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:49:45,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-25 05:49:45,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:49:45,551 INFO L225 Difference]: With dead ends: 490 [2018-01-25 05:49:45,551 INFO L226 Difference]: Without dead ends: 298 [2018-01-25 05:49:45,552 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 05:49:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-01-25 05:49:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 262. [2018-01-25 05:49:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-01-25 05:49:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 315 transitions. [2018-01-25 05:49:45,565 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 315 transitions. Word has length 22 [2018-01-25 05:49:45,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:49:45,566 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 315 transitions. [2018-01-25 05:49:45,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:49:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 315 transitions. [2018-01-25 05:49:45,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:49:45,567 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:49:45,567 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] [2018-01-25 05:49:45,567 INFO L371 AbstractCegarLoop]: === Iteration 9 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:49:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1293570492, now seen corresponding path program 1 times [2018-01-25 05:49:45,568 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:49:45,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:45,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:49:45,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:45,569 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:49:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:49:45,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:49:45,650 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 05:49:45,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:49:45,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:49:45,651 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:49:45,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:49:45,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:49:45,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:49:45,651 INFO L87 Difference]: Start difference. First operand 262 states and 315 transitions. Second operand 4 states. [2018-01-25 05:49:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:49:45,832 INFO L93 Difference]: Finished difference Result 288 states and 347 transitions. [2018-01-25 05:49:45,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:49:45,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-25 05:49:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:49:45,834 INFO L225 Difference]: With dead ends: 288 [2018-01-25 05:49:45,835 INFO L226 Difference]: Without dead ends: 275 [2018-01-25 05:49:45,835 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 05:49:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-01-25 05:49:45,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 264. [2018-01-25 05:49:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-01-25 05:49:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 313 transitions. [2018-01-25 05:49:45,848 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 313 transitions. Word has length 26 [2018-01-25 05:49:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:49:45,849 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 313 transitions. [2018-01-25 05:49:45,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:49:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 313 transitions. [2018-01-25 05:49:45,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:49:45,850 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:49:45,850 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] [2018-01-25 05:49:45,850 INFO L371 AbstractCegarLoop]: === Iteration 10 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:49:45,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1293570493, now seen corresponding path program 1 times [2018-01-25 05:49:45,850 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:49:45,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:45,851 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:49:45,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:45,851 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:49:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:49:45,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:49:45,949 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 05:49:45,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:49:45,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:49:45,949 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:49:45,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:49:45,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:49:45,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:49:45,950 INFO L87 Difference]: Start difference. First operand 264 states and 313 transitions. Second operand 5 states. [2018-01-25 05:49:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:49:46,232 INFO L93 Difference]: Finished difference Result 300 states and 355 transitions. [2018-01-25 05:49:46,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:49:46,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-25 05:49:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:49:46,234 INFO L225 Difference]: With dead ends: 300 [2018-01-25 05:49:46,234 INFO L226 Difference]: Without dead ends: 287 [2018-01-25 05:49:46,235 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:49:46,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-25 05:49:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2018-01-25 05:49:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-01-25 05:49:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 307 transitions. [2018-01-25 05:49:46,246 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 307 transitions. Word has length 26 [2018-01-25 05:49:46,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:49:46,247 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 307 transitions. [2018-01-25 05:49:46,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:49:46,247 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 307 transitions. [2018-01-25 05:49:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:49:46,247 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:49:46,248 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:49:46,248 INFO L371 AbstractCegarLoop]: === Iteration 11 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:49:46,248 INFO L82 PathProgramCache]: Analyzing trace with hash 987277154, now seen corresponding path program 1 times [2018-01-25 05:49:46,248 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:49:46,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:46,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:49:46,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:46,250 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:49:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:49:46,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:49:46,318 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 05:49:46,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:49:46,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:49:46,318 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:49:46,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:49:46,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:49:46,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:49:46,319 INFO L87 Difference]: Start difference. First operand 265 states and 307 transitions. Second operand 5 states. [2018-01-25 05:49:46,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:49:46,563 INFO L93 Difference]: Finished difference Result 335 states and 391 transitions. [2018-01-25 05:49:46,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:49:46,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-25 05:49:46,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:49:46,566 INFO L225 Difference]: With dead ends: 335 [2018-01-25 05:49:46,566 INFO L226 Difference]: Without dead ends: 334 [2018-01-25 05:49:46,567 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:49:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-25 05:49:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 275. [2018-01-25 05:49:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-01-25 05:49:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 321 transitions. [2018-01-25 05:49:46,579 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 321 transitions. Word has length 32 [2018-01-25 05:49:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:49:46,579 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 321 transitions. [2018-01-25 05:49:46,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:49:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 321 transitions. [2018-01-25 05:49:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:49:46,580 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:49:46,580 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:49:46,580 INFO L371 AbstractCegarLoop]: === Iteration 12 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:49:46,581 INFO L82 PathProgramCache]: Analyzing trace with hash 987277155, now seen corresponding path program 1 times [2018-01-25 05:49:46,581 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:49:46,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:46,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:49:46,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:46,582 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:49:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:49:46,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:49:46,802 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 05:49:46,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:49:46,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:49:46,802 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:49:46,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:49:46,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:49:46,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:49:46,803 INFO L87 Difference]: Start difference. First operand 275 states and 321 transitions. Second operand 6 states. [2018-01-25 05:49:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:49:47,407 INFO L93 Difference]: Finished difference Result 540 states and 635 transitions. [2018-01-25 05:49:47,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:49:47,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-25 05:49:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:49:47,409 INFO L225 Difference]: With dead ends: 540 [2018-01-25 05:49:47,409 INFO L226 Difference]: Without dead ends: 283 [2018-01-25 05:49:47,410 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:49:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-01-25 05:49:47,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2018-01-25 05:49:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-01-25 05:49:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 317 transitions. [2018-01-25 05:49:47,420 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 317 transitions. Word has length 32 [2018-01-25 05:49:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:49:47,420 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 317 transitions. [2018-01-25 05:49:47,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:49:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 317 transitions. [2018-01-25 05:49:47,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 05:49:47,421 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:49:47,422 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-25 05:49:47,422 INFO L371 AbstractCegarLoop]: === Iteration 13 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 05:49:47,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1656548387, now seen corresponding path program 1 times [2018-01-25 05:49:47,422 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:49:47,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:47,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:49:47,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:49:47,423 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:49:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:49:47,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:49:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:49:47,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:49:47,572 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:49:47,572 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-25 05:49:47,574 INFO L201 CegarAbsIntRunner]: [0], [9], [18], [19], [20], [21], [22], [25], [29], [34], [35], [38], [39], [40], [42], [44], [145], [146], [149], [153], [252], [253], [257], [258], [259], [260], [263], [266], [267], [272], [296], [300], [301], [302], [304] [2018-01-25 05:49:47,620 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:49:47,620 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:50:02,043 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 05:50:02,045 INFO L268 AbstractInterpreter]: Visited 35 different actions 43 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-25 05:50:02,061 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 05:50:13,093 INFO L232 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 76.84% of their original sizes. [2018-01-25 05:50:13,093 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 05:50:15,189 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse146 (select (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|) |c_main_~#list~13.offset|)) (.cse44 (select |c_#valid| 0)) (.cse147 (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|) |c_main_~#list~13.offset|)) (.cse178 (select |c_old(#valid)| 0))) (and (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse7 (select |c_#memory_int| v_weq0_1))) (let ((.cse0 (select .cse7 v_weq1_1)) (.cse1 (select |c_old(#memory_int)| v_weq0_1))) (or (= .cse0 (select .cse1 v_weq1_1)) (let ((.cse8 (select |c_#memory_int| |c_main_~#list~13.base|)) (.cse9 (select |c_#memory_$Pointer$.base| v_weq0_1)) (.cse10 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse5 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse3 (select |c_#valid| 0)) (.cse6 (select |c_old(#valid)| v_weq0_1)) (.cse12 (select |c_old(#valid)| 0)) (.cse2 (select .cse5 v_weq1_1)) (.cse11 (select .cse10 |c_main_~#list~13.offset|)) (.cse15 (select .cse7 |c_main_~#list~13.offset|)) (.cse17 (select .cse9 |c_main_~#list~13.offset|)) (.cse13 (select .cse9 v_weq1_1)) (.cse19 (select .cse5 |c_main_~#list~13.offset|)) (.cse16 (select .cse8 v_weq1_1)) (.cse18 (select .cse8 |c_main_~#list~13.offset|)) (.cse14 (select |c_#valid| |c_main_~#list~13.base|))) (and (= .cse2 .cse3) (= .cse4 .cse5) (= (select .cse4 |c_main_~#list~13.offset|) .cse6) (= .cse7 .cse8) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse9 .cse10) (= .cse11 .cse12) (= (select .cse7 .cse2) .cse0) (= v_weq1_1 .cse13) (= .cse3 |c_#NULL.base|) (not (= 0 v_weq0_1)) (= .cse14 (select |c_#valid| v_weq0_1)) (= (select |c_#length| v_weq0_1) 4) (= .cse6 .cse2) (= .cse12 v_weq1_1) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= |c_#NULL.base| 0) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|)) (= .cse15 .cse16) (= |c_#NULL.offset| .cse17) (= .cse18 (select .cse8 .cse2)) (= 0 .cse11) (= .cse19 |c_#NULL.offset|) (= .cse0 .cse15) (= |c_main_~#list~13.base| v_weq0_1) (= .cse17 |c_main_~#list~13.offset|) (= (select |c_old(#memory_int)| |c_main_~#list~13.base|) .cse1) (= .cse13 .cse19) (= .cse16 .cse18) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (= 1 .cse14)))))))) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 0)) (= (select (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|) v_weq0_1) (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|) v_weq0_1)))) (forall ((v_weq0_1 Int)) (or (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)) (not (= v_weq0_1 0)) (let ((.cse27 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse26 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse22 (select .cse26 v_weq0_1)) (.cse24 (select .cse27 |c_main_~#list~13.offset|)) (.cse21 (select |c_#valid| 0)) (.cse25 (select |c_old(#valid)| 0)) (.cse20 (select .cse27 v_weq0_1))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse20 .cse21) (= v_weq0_1 .cse22) (let ((.cse23 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse23 |c_main_~#list~13.offset|) (select .cse23 v_weq0_1))) (= .cse22 |c_#NULL.offset|) (= .cse24 .cse25) (= 0 .cse24) (not (= 0 |c_main_~#list~13.base|)) (= .cse21 |c_#NULL.base|) (= .cse25 v_weq0_1) (= (select .cse26 |c_main_~#list~13.offset|) .cse20) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|))))))) (forall ((v_weq0_1 Int)) (let ((.cse34 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse28 (select .cse34 v_weq0_1))) (or (= .cse28 (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|) v_weq0_1)) (let ((.cse35 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|))) (let ((.cse32 (select .cse35 |c_main_~#list~13.offset|)) (.cse30 (select |c_#valid| 0)) (.cse33 (select |c_old(#valid)| 0)) (.cse29 (select .cse35 v_weq0_1))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse29 .cse30) (= v_weq0_1 .cse28) (let ((.cse31 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse31 |c_main_~#list~13.offset|) (select .cse31 v_weq0_1))) (= .cse28 |c_#NULL.offset|) (= .cse32 .cse33) (= 0 .cse32) (not (= 0 |c_main_~#list~13.base|)) (= .cse30 |c_#NULL.base|) (= .cse33 v_weq0_1) (= (select .cse34 |c_main_~#list~13.offset|) .cse29) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|))))))))) (forall ((v_weq0_1 Int)) (or (= (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)) (not (= v_weq0_1 0)) (let ((.cse43 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse42 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse38 (select .cse42 v_weq0_1)) (.cse40 (select .cse43 |c_main_~#list~13.offset|)) (.cse37 (select |c_#valid| 0)) (.cse41 (select |c_old(#valid)| 0)) (.cse36 (select .cse43 v_weq0_1))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse36 .cse37) (= v_weq0_1 .cse38) (let ((.cse39 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse39 |c_main_~#list~13.offset|) (select .cse39 v_weq0_1))) (= .cse38 |c_#NULL.offset|) (= .cse40 .cse41) (= 0 .cse40) (not (= 0 |c_main_~#list~13.base|)) (= .cse37 |c_#NULL.base|) (= .cse41 v_weq0_1) (= (select .cse42 |c_main_~#list~13.offset|) .cse36) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|))))))) (= .cse44 |c_#NULL.offset|) (forall ((v_weq0_1 Int)) (or (= (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)) (let ((.cse52 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse51 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse47 (select .cse51 v_weq0_1)) (.cse49 (select .cse52 |c_main_~#list~13.offset|)) (.cse46 (select |c_#valid| 0)) (.cse50 (select |c_old(#valid)| 0)) (.cse45 (select .cse52 v_weq0_1))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse45 .cse46) (= v_weq0_1 .cse47) (let ((.cse48 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse48 |c_main_~#list~13.offset|) (select .cse48 v_weq0_1))) (= .cse47 |c_#NULL.offset|) (= .cse49 .cse50) (= 0 .cse49) (not (= 0 |c_main_~#list~13.base|)) (= .cse46 |c_#NULL.base|) (= .cse50 v_weq0_1) (= (select .cse51 |c_main_~#list~13.offset|) .cse45) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|))))))) (= |c_#NULL.offset| |c_#NULL.base|) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (let ((.cse59 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse60 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|))) (let ((.cse53 (select .cse60 v_weq1_1)) (.cse54 (select .cse60 |c_main_~#list~13.offset|)) (.cse55 (select |c_old(#valid)| 0)) (.cse56 (select |c_#valid| 0)) (.cse58 (select .cse59 v_weq1_1))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse53 |c_#NULL.offset|) (= .cse54 .cse55) (= v_weq1_1 .cse53) (= 0 .cse54) (not (= 0 |c_main_~#list~13.base|)) (= .cse56 |c_#NULL.base|) (let ((.cse57 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse57 v_weq1_1) (select .cse57 |c_main_~#list~13.offset|))) (= .cse55 .cse58) (= (select .cse59 |c_main_~#list~13.offset|) .cse56) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= .cse58 v_weq1_1)))) (not (= v_weq1_1 0)) (not (= v_weq0_1 |c_main_~#list~13.base|)) (= (select (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) v_weq1_1) (select (select |c_old(#memory_$Pointer$.base)| v_weq0_1) v_weq1_1)))) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (let ((.cse67 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse68 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|))) (let ((.cse61 (select .cse68 v_weq1_1)) (.cse62 (select .cse68 |c_main_~#list~13.offset|)) (.cse63 (select |c_old(#valid)| 0)) (.cse64 (select |c_#valid| 0)) (.cse66 (select .cse67 v_weq1_1))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse61 |c_#NULL.offset|) (= .cse62 .cse63) (= v_weq1_1 .cse61) (= 0 .cse62) (not (= 0 |c_main_~#list~13.base|)) (= .cse64 |c_#NULL.base|) (let ((.cse65 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse65 v_weq1_1) (select .cse65 |c_main_~#list~13.offset|))) (= .cse63 .cse66) (= (select .cse67 |c_main_~#list~13.offset|) .cse64) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= .cse66 v_weq1_1)))) (= (select (select |c_#memory_$Pointer$.offset| v_weq0_1) v_weq1_1) (select (select |c_old(#memory_$Pointer$.base)| v_weq0_1) v_weq1_1)) (not (= v_weq1_1 0)) (not (= v_weq0_1 |c_main_~#list~13.base|)))) (not (= |c_#valid| |c_#length|)) (forall ((v_weq0_1 Int)) (or (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) v_weq0_1) (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|) v_weq0_1)) (not (= v_weq0_1 0)) (let ((.cse76 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse75 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse71 (select .cse75 v_weq0_1)) (.cse73 (select .cse76 |c_main_~#list~13.offset|)) (.cse70 (select |c_#valid| 0)) (.cse74 (select |c_old(#valid)| 0)) (.cse69 (select .cse76 v_weq0_1))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse69 .cse70) (= v_weq0_1 .cse71) (let ((.cse72 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse72 |c_main_~#list~13.offset|) (select .cse72 v_weq0_1))) (= .cse71 |c_#NULL.offset|) (= .cse73 .cse74) (= 0 .cse73) (not (= 0 |c_main_~#list~13.base|)) (= .cse70 |c_#NULL.base|) (= .cse74 v_weq0_1) (= (select .cse75 |c_main_~#list~13.offset|) .cse69) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|))))))) (forall ((v_weq0_1 Int)) (let ((.cse84 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|))) (let ((.cse77 (select .cse84 v_weq0_1))) (or (let ((.cse83 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse79 (select .cse83 v_weq0_1)) (.cse81 (select .cse84 |c_main_~#list~13.offset|)) (.cse78 (select |c_#valid| 0)) (.cse82 (select |c_old(#valid)| 0))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse77 .cse78) (= v_weq0_1 .cse79) (let ((.cse80 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse80 |c_main_~#list~13.offset|) (select .cse80 v_weq0_1))) (= .cse79 |c_#NULL.offset|) (= .cse81 .cse82) (= 0 .cse81) (not (= 0 |c_main_~#list~13.base|)) (= .cse78 |c_#NULL.base|) (= .cse82 v_weq0_1) (= (select .cse83 |c_main_~#list~13.offset|) .cse77) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|))))) (= .cse77 (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) v_weq0_1)))))) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)) (not (= v_weq0_1 0)))) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (not (= |c_#length| |c_old(#valid)|)) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse94 (select |c_#memory_$Pointer$.base| v_weq0_1))) (let ((.cse86 (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (.cse85 (select .cse94 v_weq1_1))) (or (= .cse85 (select .cse86 v_weq1_1)) (let ((.cse93 (select |c_#memory_int| |c_main_~#list~13.base|)) (.cse92 (select |c_#memory_int| v_weq0_1)) (.cse95 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse90 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse89 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse88 (select |c_#valid| 0)) (.cse91 (select |c_old(#valid)| v_weq0_1)) (.cse97 (select |c_old(#valid)| 0)) (.cse87 (select .cse90 v_weq1_1)) (.cse96 (select .cse95 |c_main_~#list~13.offset|)) (.cse98 (select .cse92 v_weq1_1)) (.cse100 (select .cse92 |c_main_~#list~13.offset|)) (.cse102 (select .cse94 |c_main_~#list~13.offset|)) (.cse104 (select .cse90 |c_main_~#list~13.offset|)) (.cse101 (select .cse93 v_weq1_1)) (.cse103 (select .cse93 |c_main_~#list~13.offset|)) (.cse99 (select |c_#valid| |c_main_~#list~13.base|))) (and (= .cse87 .cse88) (= .cse89 .cse90) (= (select .cse89 |c_main_~#list~13.offset|) .cse91) (= .cse92 .cse93) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) .cse86) (= .cse94 .cse95) (= .cse96 .cse97) (= (select .cse92 .cse87) .cse98) (= v_weq1_1 .cse85) (= .cse88 |c_#NULL.base|) (not (= 0 v_weq0_1)) (= .cse99 (select |c_#valid| v_weq0_1)) (= (select |c_#length| v_weq0_1) 4) (= .cse91 .cse87) (= .cse97 v_weq1_1) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= |c_#NULL.base| 0) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|)) (= .cse100 .cse101) (= |c_#NULL.offset| .cse102) (= .cse103 (select .cse93 .cse87)) (= 0 .cse96) (= .cse104 |c_#NULL.offset|) (= .cse98 .cse100) (= |c_main_~#list~13.base| v_weq0_1) (= .cse102 |c_main_~#list~13.offset|) (= (select |c_old(#memory_int)| |c_main_~#list~13.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse85 .cse104) (= .cse101 .cse103) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (= 1 .cse99)))))))) (forall ((v_weq0_1 Int)) (let ((.cse106 (select |c_#valid| v_weq0_1)) (.cse105 (select |c_old(#valid)| v_weq0_1))) (or (= .cse105 .cse106) (let ((.cse108 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse114 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse109 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse107 (select .cse109 |c_main_~#list~13.offset|)) (.cse112 (select .cse114 |c_main_~#list~13.offset|)) (.cse110 (select |c_#valid| 0)) (.cse113 (select .cse108 |c_main_~#list~13.offset|)) (.cse115 (select |c_old(#valid)| 0)) (.cse111 (select |c_#memory_int| |c_main_~#list~13.base|)) (.cse116 (select |c_#valid| |c_main_~#list~13.base|))) (and (= .cse107 .cse105) (= .cse108 .cse109) (= .cse105 .cse110) (= (select |c_#memory_int| v_weq0_1) .cse111) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|)) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse112 .cse113) (= (select |c_#memory_$Pointer$.base| v_weq0_1) .cse114) (= .cse115 .cse107) (= 0 .cse112) (= .cse110 |c_#NULL.offset|) (= |c_#NULL.offset| |c_#NULL.base|) (= |c_main_~#list~13.base| v_weq0_1) (= .cse113 .cse115) (= .cse116 .cse106) (= (select |c_old(#memory_int)| |c_main_~#list~13.base|) (select |c_old(#memory_int)| v_weq0_1)) (= (select |c_#length| v_weq0_1) 4) (= (select .cse111 |c_main_~#list~13.offset|) (select .cse111 .cse105)) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (not (= v_weq0_1 0)) (= 1 .cse116) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= |c_#NULL.base| |c_main_~#list~13.offset|))))))) (forall ((v_weq0_1 Int)) (let ((.cse121 (select |c_#memory_int| |c_main_~#list~13.base|))) (let ((.cse117 (select .cse121 v_weq0_1))) (or (= (select (select |c_old(#memory_int)| |c_main_~#list~13.base|) v_weq0_1) .cse117) (let ((.cse125 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse124 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse120 (select .cse124 v_weq0_1)) (.cse122 (select .cse125 |c_main_~#list~13.offset|)) (.cse119 (select |c_#valid| 0)) (.cse123 (select |c_old(#valid)| 0)) (.cse118 (select .cse125 v_weq0_1))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse118 .cse119) (= v_weq0_1 .cse120) (= (select .cse121 |c_main_~#list~13.offset|) .cse117) (= .cse120 |c_#NULL.offset|) (= .cse122 .cse123) (= 0 .cse122) (not (= 0 |c_main_~#list~13.base|)) (= .cse119 |c_#NULL.base|) (= .cse123 v_weq0_1) (= (select .cse124 |c_main_~#list~13.offset|) .cse118) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|))))))))) (forall ((v_weq0_1 Int)) (let ((.cse126 (select |c_#length| v_weq0_1))) (or (= .cse126 (select |c_old(#length)| v_weq0_1)) (let ((.cse129 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse135 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse130 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse127 (select .cse130 |c_main_~#list~13.offset|)) (.cse133 (select .cse135 |c_main_~#list~13.offset|)) (.cse131 (select |c_#valid| 0)) (.cse134 (select .cse129 |c_main_~#list~13.offset|)) (.cse136 (select |c_old(#valid)| 0)) (.cse132 (select |c_#memory_int| |c_main_~#list~13.base|)) (.cse128 (select |c_old(#valid)| v_weq0_1)) (.cse137 (select |c_#valid| |c_main_~#list~13.base|))) (and (= .cse127 .cse128) (= .cse129 .cse130) (= .cse128 .cse131) (= (select |c_#memory_int| v_weq0_1) .cse132) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|)) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse133 .cse134) (= (select |c_#memory_$Pointer$.base| v_weq0_1) .cse135) (= .cse136 .cse127) (= 0 .cse133) (= .cse131 |c_#NULL.offset|) (= |c_#NULL.offset| |c_#NULL.base|) (= |c_main_~#list~13.base| v_weq0_1) (= .cse134 .cse136) (= .cse137 (select |c_#valid| v_weq0_1)) (= (select |c_old(#memory_int)| |c_main_~#list~13.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse126 4) (= (select .cse132 |c_main_~#list~13.offset|) (select .cse132 .cse128)) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (not (= v_weq0_1 0)) (= 1 .cse137) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= |c_#NULL.base| |c_main_~#list~13.offset|))))))) (forall ((v_weq0_1 Int)) (let ((.cse145 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|))) (let ((.cse138 (select .cse145 v_weq0_1))) (or (= .cse138 (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|) v_weq0_1)) (not (= v_weq0_1 0)) (let ((.cse144 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse140 (select .cse144 v_weq0_1)) (.cse142 (select .cse145 |c_main_~#list~13.offset|)) (.cse139 (select |c_#valid| 0)) (.cse143 (select |c_old(#valid)| 0))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse138 .cse139) (= v_weq0_1 .cse140) (let ((.cse141 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse141 |c_main_~#list~13.offset|) (select .cse141 v_weq0_1))) (= .cse140 |c_#NULL.offset|) (= .cse142 .cse143) (= 0 .cse142) (not (= 0 |c_main_~#list~13.base|)) (= .cse139 |c_#NULL.base|) (= .cse143 v_weq0_1) (= (select .cse144 |c_main_~#list~13.offset|) .cse138) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|))))))))) (= .cse146 .cse147) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)))) (= 0 .cse146) (not (= 0 |c_main_~#list~13.base|)) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse152 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse148 (select |c_old(#memory_$Pointer$.offset)| v_weq0_1)) (.cse149 (select .cse152 v_weq1_1))) (or (= (select .cse148 v_weq1_1) .cse149) (let ((.cse151 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse158 (select |c_#memory_$Pointer$.base| v_weq0_1)) (.cse153 (select |c_old(#valid)| v_weq0_1)) (.cse157 (select |c_#memory_int| |c_main_~#list~13.base|)) (.cse156 (select |c_#memory_int| v_weq0_1)) (.cse159 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|))) (let ((.cse154 (select .cse159 v_weq1_1)) (.cse150 (select |c_#valid| 0)) (.cse163 (select .cse156 |c_main_~#list~13.offset|)) (.cse160 (select .cse159 |c_main_~#list~13.offset|)) (.cse168 (select .cse157 .cse149)) (.cse164 (select .cse156 .cse153)) (.cse155 (select .cse152 |c_main_~#list~13.offset|)) (.cse166 (select .cse158 |c_main_~#list~13.offset|)) (.cse165 (select .cse157 v_weq1_1)) (.cse167 (select .cse157 |c_main_~#list~13.offset|)) (.cse162 (select |c_#valid| |c_main_~#list~13.base|)) (.cse161 (select |c_old(#valid)| 0)) (.cse169 (select .cse151 v_weq1_1))) (and (= .cse149 .cse150) (= .cse151 .cse152) (= (select .cse151 |c_main_~#list~13.offset|) .cse153) (= .cse154 .cse155) (= .cse156 .cse157) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse158 .cse159) (= .cse160 .cse161) (= v_weq1_1 .cse154) (= .cse150 |c_#NULL.base|) (not (= 0 v_weq0_1)) (= .cse162 (select |c_#valid| v_weq0_1)) (= (select |c_#length| v_weq0_1) 4) (= .cse153 .cse149) (= (select .cse156 .cse149) .cse163) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= |c_#NULL.base| 0) (= .cse164 (select .cse157 .cse153)) (= .cse148 (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|)) (= .cse163 .cse165) (= |c_#NULL.offset| .cse166) (= .cse167 .cse168) (= 0 .cse160) (= .cse168 .cse164) (= .cse155 |c_#NULL.offset|) (= |c_main_~#list~13.base| v_weq0_1) (= .cse166 |c_main_~#list~13.offset|) (= (select |c_old(#memory_int)| |c_main_~#list~13.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse165 .cse167) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (= 1 .cse162) (= .cse161 .cse169) (= .cse169 v_weq1_1)))))))) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (let ((.cse176 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse177 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|))) (let ((.cse170 (select .cse177 v_weq1_1)) (.cse171 (select .cse177 |c_main_~#list~13.offset|)) (.cse172 (select |c_old(#valid)| 0)) (.cse173 (select |c_#valid| 0)) (.cse175 (select .cse176 v_weq1_1))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse170 |c_#NULL.offset|) (= .cse171 .cse172) (= v_weq1_1 .cse170) (= 0 .cse171) (not (= 0 |c_main_~#list~13.base|)) (= .cse173 |c_#NULL.base|) (let ((.cse174 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse174 v_weq1_1) (select .cse174 |c_main_~#list~13.offset|))) (= .cse172 .cse175) (= (select .cse176 |c_main_~#list~13.offset|) .cse173) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= .cse175 v_weq1_1)))) (not (= v_weq1_1 0)) (not (= v_weq0_1 |c_main_~#list~13.base|)) (= (select (select |c_#memory_$Pointer$.base| v_weq0_1) v_weq1_1) (select (select |c_#memory_$Pointer$.offset| v_weq0_1) v_weq1_1)))) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)) (not (= v_weq0_1 0)))) (= .cse178 .cse44) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 0)) (let ((.cse186 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse185 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse181 (select .cse185 v_weq0_1)) (.cse183 (select .cse186 |c_main_~#list~13.offset|)) (.cse180 (select |c_#valid| 0)) (.cse184 (select |c_old(#valid)| 0)) (.cse179 (select .cse186 v_weq0_1))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse179 .cse180) (= v_weq0_1 .cse181) (let ((.cse182 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse182 |c_main_~#list~13.offset|) (select .cse182 v_weq0_1))) (= .cse181 |c_#NULL.offset|) (= .cse183 .cse184) (= 0 .cse183) (not (= 0 |c_main_~#list~13.base|)) (= .cse180 |c_#NULL.base|) (= .cse184 v_weq0_1) (= (select .cse185 |c_main_~#list~13.offset|) .cse179) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|))))) (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) v_weq0_1) (select |c_#valid| v_weq0_1)))) (forall ((v_weq0_1 Int)) (let ((.cse193 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse187 (select .cse193 v_weq0_1))) (or (= .cse187 (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) v_weq0_1)) (not (= v_weq0_1 0)) (let ((.cse194 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|))) (let ((.cse191 (select .cse194 |c_main_~#list~13.offset|)) (.cse189 (select |c_#valid| 0)) (.cse192 (select |c_old(#valid)| 0)) (.cse188 (select .cse194 v_weq0_1))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse188 .cse189) (= v_weq0_1 .cse187) (let ((.cse190 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse190 |c_main_~#list~13.offset|) (select .cse190 v_weq0_1))) (= .cse187 |c_#NULL.offset|) (= .cse191 .cse192) (= 0 .cse191) (not (= 0 |c_main_~#list~13.base|)) (= .cse189 |c_#NULL.base|) (= .cse192 v_weq0_1) (= (select .cse193 |c_main_~#list~13.offset|) .cse188) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|))))))))) (= .cse147 .cse178) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (= 1 (select |c_#valid| |c_main_~#list~13.base|)) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)))) (= |c_#NULL.base| |c_main_~#list~13.offset|) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (let ((.cse201 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse202 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|))) (let ((.cse195 (select .cse202 v_weq1_1)) (.cse196 (select .cse202 |c_main_~#list~13.offset|)) (.cse197 (select |c_old(#valid)| 0)) (.cse198 (select |c_#valid| 0)) (.cse200 (select .cse201 v_weq1_1))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse195 |c_#NULL.offset|) (= .cse196 .cse197) (= v_weq1_1 .cse195) (= 0 .cse196) (not (= 0 |c_main_~#list~13.base|)) (= .cse198 |c_#NULL.base|) (let ((.cse199 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse199 v_weq1_1) (select .cse199 |c_main_~#list~13.offset|))) (= .cse197 .cse200) (= (select .cse201 |c_main_~#list~13.offset|) .cse198) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= .cse200 v_weq1_1)))) (not (= v_weq1_1 0)) (not (= v_weq0_1 |c_main_~#list~13.base|)) (= (select (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) v_weq1_1) (select (select |c_#memory_$Pointer$.base| v_weq0_1) v_weq1_1)))) (not (= |c_#valid| |c_old(#valid)|)))) is different from false [2018-01-25 05:50:15,750 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse117 (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|) |c_main_~#list~13.offset|)) (.cse139 (select (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|) |c_main_~#list~13.offset|)) (.cse138 (select |c_old(#valid)| 0)) (.cse60 (select |c_#valid| 0))) (and (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse4 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse1 (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (.cse0 (select .cse4 v_weq1_1))) (or (= .cse0 (select .cse1 v_weq1_1)) (not (= v_weq1_1 0)) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse8 (select |c_#memory_int| |c_main_~#list~13.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse9 (select |c_#memory_$Pointer$.base| v_weq0_1)) (.cse7 (select |c_#memory_int| v_weq0_1))) (let ((.cse2 (select |c_#valid| 0)) (.cse6 (select |c_old(#valid)| v_weq0_1)) (.cse16 (select .cse4 |c_main_~#list~13.offset|)) (.cse11 (select .cse7 v_weq1_1)) (.cse14 (select .cse7 |c_main_~#list~13.offset|)) (.cse17 (select .cse9 |c_main_~#list~13.offset|)) (.cse19 (select .cse10 |c_main_~#list~13.offset|)) (.cse15 (select .cse8 v_weq1_1)) (.cse18 (select .cse8 |c_main_~#list~13.offset|)) (.cse20 (select .cse9 v_weq1_1)) (.cse5 (select .cse10 v_weq1_1)) (.cse12 (select |c_#valid| |c_main_~#list~13.base|)) (.cse13 (select |c_old(#valid)| 0)) (.cse21 (select .cse3 v_weq1_1))) (and (= .cse0 .cse2) (= .cse3 .cse4) (= .cse5 |c_#NULL.offset|) (= (select .cse3 |c_main_~#list~13.offset|) .cse6) (= .cse7 .cse8) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) .cse1) (= .cse9 .cse10) (= (select .cse7 .cse0) .cse11) (= .cse2 |c_#NULL.base|) (not (= 0 v_weq0_1)) (= .cse12 (select |c_#valid| v_weq0_1)) (= (select |c_#length| v_weq0_1) 4) (= .cse6 .cse0) (not (= v_weq0_1 0)) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse13) (= |c_#NULL.base| 0) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|)) (= .cse14 .cse15) (= v_weq1_1 .cse16) (= |c_#NULL.offset| .cse17) (= .cse18 (select .cse8 .cse0)) (= 0 .cse19) (= .cse16 .cse20) (= .cse11 .cse14) (= |c_main_~#list~13.base| v_weq0_1) (= .cse17 |c_main_~#list~13.offset|) (= (select |c_old(#memory_int)| |c_main_~#list~13.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse19 c_main_~dataNotFinished~13) (= .cse15 .cse18) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (= .cse20 .cse5) (= 1 .cse12) (= .cse13 .cse21) (= .cse21 v_weq1_1)))) (not (= v_weq0_1 |c_main_~#list~13.base|)))))) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 0)) (= (select (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|) v_weq0_1) (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|) v_weq0_1)))) (forall ((v_weq0_1 Int)) (or (let ((.cse29 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse28 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse24 (select .cse28 v_weq0_1)) (.cse23 (select |c_#valid| 0)) (.cse22 (select .cse29 v_weq0_1)) (.cse26 (select .cse29 |c_main_~#list~13.offset|)) (.cse27 (select |c_old(#valid)| 0))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse22 .cse23) (= v_weq0_1 .cse24) (let ((.cse25 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse25 |c_main_~#list~13.offset|) (select .cse25 v_weq0_1))) (= .cse24 |c_#NULL.offset|) (= 0 .cse26) (not (= 0 |c_main_~#list~13.base|)) (= .cse23 |c_#NULL.base|) (= .cse27 v_weq0_1) (= (select .cse28 |c_main_~#list~13.offset|) .cse22) (= .cse26 c_main_~dataNotFinished~13) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse27)))) (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)) (not (= v_weq0_1 0)))) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (not (= v_weq1_1 0)) (not (= v_weq0_1 |c_main_~#list~13.base|)) (= (select (select |c_#memory_$Pointer$.base| v_weq0_1) v_weq1_1) (select (select |c_#memory_$Pointer$.offset| v_weq0_1) v_weq1_1)))) (forall ((v_weq0_1 Int)) (or (= (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)) (let ((.cse37 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse36 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse32 (select .cse36 v_weq0_1)) (.cse31 (select |c_#valid| 0)) (.cse30 (select .cse37 v_weq0_1)) (.cse34 (select .cse37 |c_main_~#list~13.offset|)) (.cse35 (select |c_old(#valid)| 0))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse30 .cse31) (= v_weq0_1 .cse32) (let ((.cse33 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse33 |c_main_~#list~13.offset|) (select .cse33 v_weq0_1))) (= .cse32 |c_#NULL.offset|) (= 0 .cse34) (not (= 0 |c_main_~#list~13.base|)) (= .cse31 |c_#NULL.base|) (= .cse35 v_weq0_1) (= (select .cse36 |c_main_~#list~13.offset|) .cse30) (= .cse34 c_main_~dataNotFinished~13) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse35)))) (not (= v_weq0_1 0)))) (forall ((v_weq0_1 Int)) (let ((.cse45 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|))) (let ((.cse38 (select .cse45 v_weq0_1))) (or (= .cse38 (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|) v_weq0_1)) (let ((.cse44 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse40 (select .cse44 v_weq0_1)) (.cse39 (select |c_#valid| 0)) (.cse42 (select .cse45 |c_main_~#list~13.offset|)) (.cse43 (select |c_old(#valid)| 0))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse38 .cse39) (= v_weq0_1 .cse40) (let ((.cse41 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse41 |c_main_~#list~13.offset|) (select .cse41 v_weq0_1))) (= .cse40 |c_#NULL.offset|) (= 0 .cse42) (not (= 0 |c_main_~#list~13.base|)) (= .cse39 |c_#NULL.base|) (= .cse43 v_weq0_1) (= (select .cse44 |c_main_~#list~13.offset|) .cse38) (= .cse42 c_main_~dataNotFinished~13) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse43)))) (not (= v_weq0_1 0)))))) (forall ((v_weq0_1 Int)) (let ((.cse52 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse47 (select .cse52 v_weq0_1))) (or (let ((.cse53 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|))) (let ((.cse46 (select .cse53 v_weq0_1)) (.cse49 (select .cse53 |c_main_~#list~13.offset|)) (.cse50 (select |c_#valid| 0)) (.cse51 (select |c_old(#valid)| 0))) (and (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse46 0) (= v_weq0_1 .cse47) (let ((.cse48 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse48 |c_main_~#list~13.offset|) (select .cse48 v_weq0_1))) (= .cse47 |c_#NULL.offset|) (= 0 .cse49) (= |c_#NULL.base| .cse46) (not (= 0 |c_main_~#list~13.base|)) (= .cse50 |c_#NULL.base|) (= .cse51 v_weq0_1) (= .cse49 c_main_~dataNotFinished~13) (= (select .cse52 |c_main_~#list~13.offset|) .cse50) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse51)))) (= .cse47 (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) v_weq0_1)) (not (= v_weq0_1 0)))))) (forall ((v_weq0_1 Int)) (let ((.cse56 (select |c_#memory_int| |c_main_~#list~13.base|))) (let ((.cse57 (select .cse56 v_weq0_1))) (or (let ((.cse54 (select |c_#valid| 0)) (.cse59 (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|) |c_main_~#list~13.offset|)) (.cse58 (select (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|) |c_main_~#list~13.offset|)) (.cse55 (select |c_old(#valid)| 0))) (and (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= |c_#NULL.base| |c_#NULL.offset|) (= .cse54 |c_#NULL.base|) (= .cse55 v_weq0_1) (= (select .cse56 |c_main_~#list~13.offset|) .cse57) (= .cse58 .cse59) (= v_weq0_1 .cse54) (= .cse59 c_main_~dataNotFinished~13) (= 0 .cse58) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse55) (not (= 0 |c_main_~#list~13.base|)))) (= (select (select |c_old(#memory_int)| |c_main_~#list~13.base|) v_weq0_1) .cse57))))) (= .cse60 |c_#NULL.offset|) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse75 (select |c_old(#memory_$Pointer$.offset)| v_weq0_1)) (.cse69 (select |c_old(#memory_$Pointer$.base)| v_weq0_1))) (or (not (= v_weq1_1 0)) (let ((.cse63 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse68 (select |c_#memory_int| |c_main_~#list~13.base|)) (.cse71 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse70 (select |c_#memory_$Pointer$.base| v_weq0_1)) (.cse67 (select |c_#memory_int| v_weq0_1)) (.cse64 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse62 (select |c_#valid| 0)) (.cse66 (select |c_old(#valid)| v_weq0_1)) (.cse61 (select .cse64 v_weq1_1)) (.cse78 (select .cse64 |c_main_~#list~13.offset|)) (.cse72 (select .cse67 v_weq1_1)) (.cse76 (select .cse67 |c_main_~#list~13.offset|)) (.cse79 (select .cse70 |c_main_~#list~13.offset|)) (.cse81 (select .cse71 |c_main_~#list~13.offset|)) (.cse77 (select .cse68 v_weq1_1)) (.cse80 (select .cse68 |c_main_~#list~13.offset|)) (.cse82 (select .cse70 v_weq1_1)) (.cse65 (select .cse71 v_weq1_1)) (.cse73 (select |c_#valid| |c_main_~#list~13.base|)) (.cse74 (select |c_old(#valid)| 0)) (.cse83 (select .cse63 v_weq1_1))) (and (= .cse61 .cse62) (= .cse63 .cse64) (= .cse65 |c_#NULL.offset|) (= (select .cse63 |c_main_~#list~13.offset|) .cse66) (= .cse67 .cse68) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) .cse69) (= .cse70 .cse71) (= (select .cse67 .cse61) .cse72) (= .cse62 |c_#NULL.base|) (not (= 0 v_weq0_1)) (= .cse73 (select |c_#valid| v_weq0_1)) (= (select |c_#length| v_weq0_1) 4) (= .cse66 .cse61) (not (= v_weq0_1 0)) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse74) (= |c_#NULL.base| 0) (= .cse75 (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|)) (= .cse76 .cse77) (= v_weq1_1 .cse78) (= |c_#NULL.offset| .cse79) (= .cse80 (select .cse68 .cse61)) (= 0 .cse81) (= .cse78 .cse82) (= .cse72 .cse76) (= |c_main_~#list~13.base| v_weq0_1) (= .cse79 |c_main_~#list~13.offset|) (= (select |c_old(#memory_int)| |c_main_~#list~13.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse81 c_main_~dataNotFinished~13) (= .cse77 .cse80) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (= .cse82 .cse65) (= 1 .cse73) (= .cse74 .cse83) (= .cse83 v_weq1_1)))) (not (= v_weq0_1 |c_main_~#list~13.base|)) (= (select .cse75 v_weq1_1) (select .cse69 v_weq1_1))))) (= |c_#NULL.offset| |c_#NULL.base|) (not (= |c_#valid| |c_#length|)) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse88 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse84 (select |c_old(#memory_$Pointer$.offset)| v_weq0_1)) (.cse85 (select .cse88 v_weq1_1))) (or (= (select .cse84 v_weq1_1) .cse85) (let ((.cse87 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse94 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse93 (select |c_#memory_$Pointer$.base| v_weq0_1)) (.cse90 (select |c_old(#valid)| v_weq0_1)) (.cse92 (select |c_#memory_int| |c_main_~#list~13.base|)) (.cse91 (select |c_#memory_int| v_weq0_1))) (let ((.cse86 (select |c_#valid| 0)) (.cse98 (select |c_old(#valid)| 0)) (.cse99 (select .cse91 |c_main_~#list~13.offset|)) (.cse104 (select .cse92 .cse85)) (.cse100 (select .cse91 .cse90)) (.cse102 (select .cse93 |c_main_~#list~13.offset|)) (.cse105 (select .cse94 |c_main_~#list~13.offset|)) (.cse96 (select .cse88 |c_main_~#list~13.offset|)) (.cse89 (select .cse94 v_weq1_1)) (.cse101 (select .cse92 v_weq1_1)) (.cse103 (select .cse92 |c_main_~#list~13.offset|)) (.cse95 (select .cse87 v_weq1_1)) (.cse97 (select |c_#valid| |c_main_~#list~13.base|))) (and (= .cse85 .cse86) (= .cse87 .cse88) (= .cse89 |c_#NULL.offset|) (= (select .cse87 |c_main_~#list~13.offset|) .cse90) (= .cse91 .cse92) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse93 .cse94) (= .cse95 .cse96) (= .cse86 |c_#NULL.base|) (not (= 0 v_weq0_1)) (= .cse97 (select |c_#valid| v_weq0_1)) (= (select |c_#length| v_weq0_1) 4) (= .cse90 .cse85) (= .cse98 v_weq1_1) (= (select .cse91 .cse85) .cse99) (not (= v_weq0_1 0)) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse98) (= |c_#NULL.base| 0) (= .cse100 (select .cse92 .cse90)) (= .cse84 (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|)) (= .cse99 .cse101) (= |c_#NULL.offset| .cse102) (= .cse103 .cse104) (= 0 .cse105) (= .cse104 .cse100) (= |c_main_~#list~13.base| v_weq0_1) (= .cse102 |c_main_~#list~13.offset|) (= (select |c_old(#memory_int)| |c_main_~#list~13.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse105 c_main_~dataNotFinished~13) (= .cse96 .cse89) (= .cse101 .cse103) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (= v_weq1_1 .cse95) (= 1 .cse97)))))))) (forall ((v_weq0_1 Int)) (let ((.cse107 (select |c_#valid| v_weq0_1)) (.cse106 (select |c_old(#valid)| v_weq0_1))) (or (= .cse106 .cse107) (let ((.cse112 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse109 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse108 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse110 (select |c_#valid| 0)) (.cse114 (select .cse109 |c_main_~#list~13.offset|)) (.cse115 (select .cse112 |c_main_~#list~13.offset|)) (.cse111 (select |c_#memory_int| |c_main_~#list~13.base|)) (.cse116 (select |c_#valid| |c_main_~#list~13.base|)) (.cse113 (select |c_old(#valid)| 0))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse108 .cse109) (= .cse106 .cse110) (= (select .cse108 |c_main_~#list~13.offset|) .cse106) (= (select |c_#memory_int| v_weq0_1) .cse111) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|)) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= (select |c_#memory_$Pointer$.base| v_weq0_1) .cse112) (= .cse113 .cse114) (= 0 .cse115) (= .cse110 |c_#NULL.base|) (= .cse114 |c_#NULL.offset|) (= |c_main_~#list~13.base| v_weq0_1) (= .cse116 .cse107) (= (select |c_old(#memory_int)| |c_main_~#list~13.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse115 c_main_~dataNotFinished~13) (= (select |c_#length| v_weq0_1) 4) (= (select .cse111 |c_main_~#list~13.offset|) (select .cse111 .cse106)) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (not (= v_weq0_1 0)) (= 1 .cse116) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse113))))))) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)) (not (= v_weq0_1 0)))) (= .cse117 c_main_~dataNotFinished~13) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse123 (select |c_#memory_int| v_weq0_1))) (let ((.cse127 (select .cse123 v_weq1_1)) (.cse137 (select |c_old(#memory_int)| v_weq0_1))) (or (let ((.cse124 (select |c_#memory_int| |c_main_~#list~13.base|)) (.cse126 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse125 (select |c_#memory_$Pointer$.base| v_weq0_1)) (.cse121 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse120 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse119 (select |c_#valid| 0)) (.cse122 (select |c_old(#valid)| v_weq0_1)) (.cse130 (select |c_old(#valid)| 0)) (.cse118 (select .cse121 v_weq1_1)) (.cse131 (select .cse123 |c_main_~#list~13.offset|)) (.cse133 (select .cse125 |c_main_~#list~13.offset|)) (.cse128 (select .cse125 v_weq1_1)) (.cse136 (select .cse121 |c_main_~#list~13.offset|)) (.cse135 (select .cse126 |c_main_~#list~13.offset|)) (.cse132 (select .cse124 v_weq1_1)) (.cse134 (select .cse124 |c_main_~#list~13.offset|)) (.cse129 (select |c_#valid| |c_main_~#list~13.base|))) (and (= .cse118 .cse119) (= .cse120 .cse121) (= (select .cse120 |c_main_~#list~13.offset|) .cse122) (= .cse123 .cse124) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse125 .cse126) (= (select .cse123 .cse118) .cse127) (= v_weq1_1 .cse128) (= .cse119 |c_#NULL.base|) (not (= 0 v_weq0_1)) (= .cse129 (select |c_#valid| v_weq0_1)) (= (select |c_#length| v_weq0_1) 4) (= .cse122 .cse118) (= .cse130 v_weq1_1) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse130) (= |c_#NULL.base| 0) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|)) (= .cse131 .cse132) (= |c_#NULL.offset| .cse133) (= .cse134 (select .cse124 .cse118)) (= 0 .cse135) (= .cse136 |c_#NULL.offset|) (= .cse127 .cse131) (= |c_main_~#list~13.base| v_weq0_1) (= .cse133 |c_main_~#list~13.offset|) (= (select |c_old(#memory_int)| |c_main_~#list~13.base|) .cse137) (= .cse128 .cse136) (= .cse135 c_main_~dataNotFinished~13) (= .cse132 .cse134) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (= 1 .cse129)))) (= .cse127 (select .cse137 v_weq1_1)))))) (= c_main_~dataNotFinished~13 .cse138) (not (= |c_#length| |c_old(#valid)|)) (= .cse139 .cse117) (forall ((v_weq0_1 Int)) (let ((.cse145 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|))) (or (let ((.cse140 (select |c_#valid| 0)) (.cse144 (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|) |c_main_~#list~13.offset|)) (.cse143 (select .cse145 |c_main_~#list~13.offset|)) (.cse141 (select |c_old(#valid)| 0))) (and (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= |c_#NULL.base| |c_#NULL.offset|) (= .cse140 |c_#NULL.base|) (= .cse141 v_weq0_1) (let ((.cse142 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse142 |c_main_~#list~13.offset|) (select .cse142 v_weq0_1))) (= .cse143 .cse144) (= v_weq0_1 .cse140) (= .cse144 c_main_~dataNotFinished~13) (= 0 .cse143) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse141) (not (= 0 |c_main_~#list~13.base|)))) (= (select .cse145 v_weq0_1) (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) v_weq0_1))))) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)))) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse156 (select |c_#memory_$Pointer$.base| v_weq0_1))) (let ((.cse146 (select |c_old(#memory_$Pointer$.offset)| v_weq0_1)) (.cse147 (select .cse156 v_weq1_1))) (or (not (= v_weq1_1 0)) (not (= v_weq0_1 |c_main_~#list~13.base|)) (= (select .cse146 v_weq1_1) .cse147) (let ((.cse150 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse155 (select |c_#memory_int| |c_main_~#list~13.base|)) (.cse157 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse154 (select |c_#memory_int| v_weq0_1)) (.cse151 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse149 (select |c_#valid| 0)) (.cse153 (select |c_old(#valid)| v_weq0_1)) (.cse162 (select |c_old(#valid)| 0)) (.cse148 (select .cse151 v_weq1_1)) (.cse160 (select .cse151 |c_main_~#list~13.offset|)) (.cse158 (select .cse154 v_weq1_1)) (.cse163 (select .cse154 |c_main_~#list~13.offset|)) (.cse165 (select .cse156 |c_main_~#list~13.offset|)) (.cse167 (select .cse157 |c_main_~#list~13.offset|)) (.cse164 (select .cse155 v_weq1_1)) (.cse166 (select .cse155 |c_main_~#list~13.offset|)) (.cse152 (select .cse157 v_weq1_1)) (.cse159 (select .cse150 v_weq1_1)) (.cse161 (select |c_#valid| |c_main_~#list~13.base|))) (and (= .cse148 .cse149) (= .cse150 .cse151) (= .cse152 |c_#NULL.offset|) (= (select .cse150 |c_main_~#list~13.offset|) .cse153) (= .cse154 .cse155) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse156 .cse157) (= (select .cse154 .cse148) .cse158) (= .cse159 .cse160) (= .cse149 |c_#NULL.base|) (not (= 0 v_weq0_1)) (= .cse161 (select |c_#valid| v_weq0_1)) (= (select |c_#length| v_weq0_1) 4) (= .cse153 .cse148) (= .cse162 v_weq1_1) (not (= v_weq0_1 0)) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse162) (= |c_#NULL.base| 0) (= .cse146 (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|)) (= .cse163 .cse164) (= |c_#NULL.offset| .cse165) (= .cse166 (select .cse155 .cse148)) (= 0 .cse167) (= .cse160 .cse147) (= .cse158 .cse163) (= |c_main_~#list~13.base| v_weq0_1) (= .cse165 |c_main_~#list~13.offset|) (= (select |c_old(#memory_int)| |c_main_~#list~13.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse167 c_main_~dataNotFinished~13) (= .cse164 .cse166) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (= .cse147 .cse152) (= v_weq1_1 .cse159) (= 1 .cse161)))))))) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse177 (select |c_#memory_$Pointer$.base| v_weq0_1))) (let ((.cse169 (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (.cse168 (select .cse177 v_weq1_1))) (or (= .cse168 (select .cse169 v_weq1_1)) (let ((.cse176 (select |c_#memory_int| |c_main_~#list~13.base|)) (.cse178 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse175 (select |c_#memory_int| v_weq0_1)) (.cse173 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse172 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse171 (select |c_#valid| 0)) (.cse174 (select |c_old(#valid)| v_weq0_1)) (.cse181 (select |c_old(#valid)| 0)) (.cse170 (select .cse173 v_weq1_1)) (.cse179 (select .cse175 v_weq1_1)) (.cse182 (select .cse175 |c_main_~#list~13.offset|)) (.cse184 (select .cse177 |c_main_~#list~13.offset|)) (.cse187 (select .cse173 |c_main_~#list~13.offset|)) (.cse186 (select .cse178 |c_main_~#list~13.offset|)) (.cse183 (select .cse176 v_weq1_1)) (.cse185 (select .cse176 |c_main_~#list~13.offset|)) (.cse180 (select |c_#valid| |c_main_~#list~13.base|))) (and (= .cse170 .cse171) (= .cse172 .cse173) (= (select .cse172 |c_main_~#list~13.offset|) .cse174) (= .cse175 .cse176) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) .cse169) (= .cse177 .cse178) (= (select .cse175 .cse170) .cse179) (= v_weq1_1 .cse168) (= .cse171 |c_#NULL.base|) (not (= 0 v_weq0_1)) (= .cse180 (select |c_#valid| v_weq0_1)) (= (select |c_#length| v_weq0_1) 4) (= .cse174 .cse170) (= .cse181 v_weq1_1) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse181) (= |c_#NULL.base| 0) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|)) (= .cse182 .cse183) (= |c_#NULL.offset| .cse184) (= .cse185 (select .cse176 .cse170)) (= 0 .cse186) (= .cse187 |c_#NULL.offset|) (= .cse179 .cse182) (= |c_main_~#list~13.base| v_weq0_1) (= .cse184 |c_main_~#list~13.offset|) (= (select |c_old(#memory_int)| |c_main_~#list~13.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse168 .cse187) (= .cse186 c_main_~dataNotFinished~13) (= .cse183 .cse185) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (= 1 .cse180)))))))) (forall ((v_weq0_1 Int)) (let ((.cse194 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse188 (select .cse194 v_weq0_1))) (or (= .cse188 (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|) v_weq0_1)) (let ((.cse195 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|))) (let ((.cse190 (select |c_#valid| 0)) (.cse189 (select .cse195 v_weq0_1)) (.cse192 (select .cse195 |c_main_~#list~13.offset|)) (.cse193 (select |c_old(#valid)| 0))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse189 .cse190) (= v_weq0_1 .cse188) (let ((.cse191 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse191 |c_main_~#list~13.offset|) (select .cse191 v_weq0_1))) (= .cse188 |c_#NULL.offset|) (= 0 .cse192) (not (= 0 |c_main_~#list~13.base|)) (= .cse190 |c_#NULL.base|) (= .cse193 v_weq0_1) (= (select .cse194 |c_main_~#list~13.offset|) .cse189) (= .cse192 c_main_~dataNotFinished~13) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse193)))))))) (= 0 .cse139) (not (= 0 |c_main_~#list~13.base|)) (forall ((v_weq0_1 Int)) (or (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) v_weq0_1) (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|) v_weq0_1)) (let ((.cse203 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse202 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse197 (select .cse202 v_weq0_1)) (.cse196 (select .cse203 v_weq0_1)) (.cse199 (select .cse203 |c_main_~#list~13.offset|)) (.cse200 (select |c_#valid| 0)) (.cse201 (select |c_old(#valid)| 0))) (and (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse196 0) (= v_weq0_1 .cse197) (let ((.cse198 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse198 |c_main_~#list~13.offset|) (select .cse198 v_weq0_1))) (= .cse197 |c_#NULL.offset|) (= 0 .cse199) (= |c_#NULL.base| .cse196) (not (= 0 |c_main_~#list~13.base|)) (= .cse200 |c_#NULL.base|) (= .cse201 v_weq0_1) (= .cse199 c_main_~dataNotFinished~13) (= (select .cse202 |c_main_~#list~13.offset|) .cse200) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse201)))) (not (= v_weq0_1 0)))) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)) (not (= v_weq0_1 0)))) (= .cse138 .cse60) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (= 1 (select |c_#valid| |c_main_~#list~13.base|)) (forall ((v_weq0_1 Int)) (or (let ((.cse211 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse210 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse206 (select .cse210 v_weq0_1)) (.cse205 (select |c_#valid| 0)) (.cse204 (select .cse211 v_weq0_1)) (.cse208 (select .cse211 |c_main_~#list~13.offset|)) (.cse209 (select |c_old(#valid)| 0))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse204 .cse205) (= v_weq0_1 .cse206) (let ((.cse207 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse207 |c_main_~#list~13.offset|) (select .cse207 v_weq0_1))) (= .cse206 |c_#NULL.offset|) (= 0 .cse208) (not (= 0 |c_main_~#list~13.base|)) (= .cse205 |c_#NULL.base|) (= .cse209 v_weq0_1) (= (select .cse210 |c_main_~#list~13.offset|) .cse204) (= .cse208 c_main_~dataNotFinished~13) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse209)))) (= (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)))) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)))) (forall ((v_weq0_1 Int)) (let ((.cse212 (select |c_#length| v_weq0_1))) (or (= .cse212 (select |c_old(#length)| v_weq0_1)) (let ((.cse218 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse214 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse213 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|)) (.cse216 (select |c_#valid| 0)) (.cse220 (select .cse214 |c_main_~#list~13.offset|)) (.cse221 (select .cse218 |c_main_~#list~13.offset|)) (.cse217 (select |c_#memory_int| |c_main_~#list~13.base|)) (.cse215 (select |c_old(#valid)| v_weq0_1)) (.cse222 (select |c_#valid| |c_main_~#list~13.base|)) (.cse219 (select |c_old(#valid)| 0))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse213 .cse214) (= .cse215 .cse216) (= (select .cse213 |c_main_~#list~13.offset|) .cse215) (= (select |c_#memory_int| v_weq0_1) .cse217) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~13.base|)) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= (select |c_#memory_$Pointer$.base| v_weq0_1) .cse218) (= .cse219 .cse220) (= 0 .cse221) (= .cse216 |c_#NULL.base|) (= .cse220 |c_#NULL.offset|) (= |c_main_~#list~13.base| v_weq0_1) (= .cse222 (select |c_#valid| v_weq0_1)) (= (select |c_old(#memory_int)| |c_main_~#list~13.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse221 c_main_~dataNotFinished~13) (= .cse212 4) (= (select .cse217 |c_main_~#list~13.offset|) (select .cse217 .cse215)) (= 4 (select |c_#length| |c_main_~#list~13.base|)) (not (= v_weq0_1 0)) (= 1 .cse222) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse219))))))) (forall ((v_weq0_1 Int)) (or (let ((.cse230 (select |c_#memory_$Pointer$.base| |c_main_~#list~13.base|)) (.cse229 (select |c_#memory_$Pointer$.offset| |c_main_~#list~13.base|))) (let ((.cse225 (select .cse229 v_weq0_1)) (.cse224 (select |c_#valid| 0)) (.cse223 (select .cse230 v_weq0_1)) (.cse227 (select .cse230 |c_main_~#list~13.offset|)) (.cse228 (select |c_old(#valid)| 0))) (and (= |c_#NULL.base| 0) (= |c_#NULL.offset| |c_main_~#list~13.offset|) (= .cse223 .cse224) (= v_weq0_1 .cse225) (let ((.cse226 (select |c_#memory_int| |c_main_~#list~13.base|))) (= (select .cse226 |c_main_~#list~13.offset|) (select .cse226 v_weq0_1))) (= .cse225 |c_#NULL.offset|) (= 0 .cse227) (not (= 0 |c_main_~#list~13.base|)) (= .cse224 |c_#NULL.base|) (= .cse228 v_weq0_1) (= (select .cse229 |c_main_~#list~13.offset|) .cse223) (= .cse227 c_main_~dataNotFinished~13) (= |c_main_~#list~13.offset| (select |c_old(#valid)| |c_main_~#list~13.base|)) (= c_main_~dataNotFinished~13 .cse228)))) (not (= v_weq0_1 0)) (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~13.base|) v_weq0_1) (select |c_#valid| v_weq0_1)))) (= |c_#NULL.base| |c_main_~#list~13.offset|) (not (= |c_#valid| |c_old(#valid)|)))) is different from false [2018-01-25 05:50:17,043 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 05:50:17,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:50:17,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [8] total 31 [2018-01-25 05:50:17,044 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:50:17,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-25 05:50:17,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-25 05:50:17,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=424, Unknown=2, NotChecked=86, Total=600 [2018-01-25 05:50:17,045 INFO L87 Difference]: Start difference. First operand 275 states and 317 transitions. Second operand 25 states. Received shutdown request... [2018-01-25 05:50:32,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:50:32,326 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:50:32,332 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:50:32,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:50:32 BoogieIcfgContainer [2018-01-25 05:50:32,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:50:32,333 INFO L168 Benchmark]: Toolchain (without parser) took 51586.36 ms. Allocated memory was 305.1 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 264.0 MB in the beginning and 1.3 GB in the end (delta: -990.8 MB). Peak memory consumption was 781.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:50:32,334 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:50:32,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.58 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:50:32,334 INFO L168 Benchmark]: Boogie Preprocessor took 44.79 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:50:32,334 INFO L168 Benchmark]: RCFGBuilder took 691.61 ms. Allocated memory is still 305.1 MB. Free memory was 250.1 MB in the beginning and 200.7 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 5.3 GB. [2018-01-25 05:50:32,335 INFO L168 Benchmark]: TraceAbstraction took 50621.71 ms. Allocated memory was 305.1 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 200.7 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 718.5 MB. Max. memory is 5.3 GB. [2018-01-25 05:50:32,336 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.15 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.58 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.79 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 691.61 ms. Allocated memory is still 305.1 MB. Free memory was 250.1 MB in the beginning and 200.7 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50621.71 ms. Allocated memory was 305.1 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 200.7 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 718.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 24 LocStat_MAX_SIZEOF_WEQEDGELABEL : 5 LocStat_NO_SUPPORTING_EQUALITIES : 616 LocStat_NO_SUPPORTING_DISEQUALITIES : 169 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 43 TransStat_MAX_WEQGRAPH_SIZE : 14 TransStat_MAX_SIZEOF_WEQEDGELABEL : 4 TransStat_NO_SUPPORTING_EQUALITIES : 103 TransStat_NO_SUPPORTING_DISEQUALITIES : 19 TransStat_NO_DISJUNCTIONS : 45 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 108.465241 RENAME_VARIABLES(MILLISECONDS) : 24.884483 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 108.399653 PROJECTAWAY(MILLISECONDS) : 36.678211 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.034516 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 24.952074 ADD_EQUALITY(MILLISECONDS) : 0.095229 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.039621 #CONJOIN_DISJUNCTIVE : 73 #RENAME_VARIABLES : 99 #UNFREEZE : 0 #CONJOIN : 164 #PROJECTAWAY : 91 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 97 #ADD_EQUALITY : 115 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 585]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 585). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 14 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 215 locations, 91 error locations. TIMEOUT Result, 50.5s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 19.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2204 SDtfs, 1010 SDslu, 3693 SDs, 0 SdLazy, 3384 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 117 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 14.4s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9352081560622413 AbsIntWeakeningRatio, 1.0526315789473684 AbsIntAvgWeakeningVarsNumRemoved, 22.526315789473685 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 150 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 28837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 0/5 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/complex_data_creation_test02_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-50-32-348.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-50-32-348.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-50-32-348.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-50-32-348.csv Completed graceful shutdown