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.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:40:04,931 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:40:04,932 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:40:04,949 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:40:04,949 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:40:04,950 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:40:04,951 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:40:04,953 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:40:04,954 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:40:04,955 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:40:04,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:40:04,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:40:04,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:40:04,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:40:04,958 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:40:04,961 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:40:04,963 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:40:04,965 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:40:04,966 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:40:04,968 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:40:04,970 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:40:04,970 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:40:04,970 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:40:04,971 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:40:04,972 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:40:04,974 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:40:04,974 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:40:04,974 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:40:04,975 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:40:04,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:40:04,975 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:40:04,976 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.epf [2018-01-24 15:40:04,986 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:40:04,986 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:40:04,987 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:40:04,987 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:40:04,987 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:40:04,988 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:40:04,988 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:40:04,989 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:40:04,989 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:40:04,989 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:40:04,989 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:40:04,989 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:40:04,990 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:40:04,990 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:40:04,990 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:40:04,990 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:40:04,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:40:04,991 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:40:04,991 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:40:04,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:40:04,991 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:40:04,991 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:40:04,992 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:40:04,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:40:04,992 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:40:04,992 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:40:04,993 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:40:04,993 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:40:04,993 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:40:04,993 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:40:04,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:40:04,993 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:40:04,994 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:40:04,995 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:40:04,995 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:40:05,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:40:05,044 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:40:05,048 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:40:05,050 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:40:05,050 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:40:05,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01_false-valid-memtrack.i [2018-01-24 15:40:05,249 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:40:05,255 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:40:05,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:40:05,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:40:05,261 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:40:05,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:40:05" (1/1) ... [2018-01-24 15:40:05,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c12ca8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:40:05, skipping insertion in model container [2018-01-24 15:40:05,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:40:05" (1/1) ... [2018-01-24 15:40:05,279 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:40:05,319 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:40:05,455 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:40:05,484 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:40:05,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:40:05 WrapperNode [2018-01-24 15:40:05,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:40:05,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:40:05,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:40:05,498 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:40:05,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:40:05" (1/1) ... [2018-01-24 15:40:05,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:40:05" (1/1) ... [2018-01-24 15:40:05,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:40:05" (1/1) ... [2018-01-24 15:40:05,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:40:05" (1/1) ... [2018-01-24 15:40:05,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:40:05" (1/1) ... [2018-01-24 15:40:05,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:40:05" (1/1) ... [2018-01-24 15:40:05,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:40:05" (1/1) ... [2018-01-24 15:40:05,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:40:05,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:40:05,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:40:05,545 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:40:05,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:40:05" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:40:05,601 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:40:05,602 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:40:05,602 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-24 15:40:05,602 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-24 15:40:05,602 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 15:40:05,602 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:40:05,602 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:40:05,602 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:40:05,602 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 15:40:05,602 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 15:40:05,603 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:40:05,603 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:40:05,603 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:40:05,603 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 15:40:05,603 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 15:40:05,603 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:40:05,603 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-24 15:40:05,603 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-24 15:40:05,603 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 15:40:05,603 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:40:05,604 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:40:05,604 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:40:06,321 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:40:06,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:40:06 BoogieIcfgContainer [2018-01-24 15:40:06,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:40:06,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:40:06,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:40:06,325 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:40:06,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:40:05" (1/3) ... [2018-01-24 15:40:06,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394a66d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:40:06, skipping insertion in model container [2018-01-24 15:40:06,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:40:05" (2/3) ... [2018-01-24 15:40:06,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394a66d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:40:06, skipping insertion in model container [2018-01-24 15:40:06,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:40:06" (3/3) ... [2018-01-24 15:40:06,330 INFO L105 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01_false-valid-memtrack.i [2018-01-24 15:40:06,339 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:40:06,348 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-01-24 15:40:06,403 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:40:06,404 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:40:06,404 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:40:06,404 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:40:06,404 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:40:06,404 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:40:06,405 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:40:06,405 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:40:06,406 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:40:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states. [2018-01-24 15:40:06,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 15:40:06,441 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:40:06,442 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:40:06,442 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-24 15:40:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1826704007, now seen corresponding path program 1 times [2018-01-24 15:40:06,450 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:40:06,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:06,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:40:06,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:06,510 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:40:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:40:06,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:40:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:40:06,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:40:06,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:40:06,625 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:40:06,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:40:06,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:40:06,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:40:06,749 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 3 states. [2018-01-24 15:40:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:40:07,044 INFO L93 Difference]: Finished difference Result 412 states and 451 transitions. [2018-01-24 15:40:07,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:40:07,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 15:40:07,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:40:07,063 INFO L225 Difference]: With dead ends: 412 [2018-01-24 15:40:07,063 INFO L226 Difference]: Without dead ends: 205 [2018-01-24 15:40:07,069 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:40:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-24 15:40:07,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-01-24 15:40:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-24 15:40:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 217 transitions. [2018-01-24 15:40:07,126 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 217 transitions. Word has length 7 [2018-01-24 15:40:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:40:07,127 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 217 transitions. [2018-01-24 15:40:07,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:40:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 217 transitions. [2018-01-24 15:40:07,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 15:40:07,127 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:40:07,128 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:40:07,128 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-24 15:40:07,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1826704008, now seen corresponding path program 1 times [2018-01-24 15:40:07,128 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:40:07,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:07,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:40:07,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:07,130 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:40:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:40:07,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:40:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:40:07,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:40:07,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:40:07,215 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:40:07,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:40:07,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:40:07,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:40:07,218 INFO L87 Difference]: Start difference. First operand 205 states and 217 transitions. Second operand 3 states. [2018-01-24 15:40:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:40:07,398 INFO L93 Difference]: Finished difference Result 207 states and 220 transitions. [2018-01-24 15:40:07,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:40:07,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 15:40:07,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:40:07,403 INFO L225 Difference]: With dead ends: 207 [2018-01-24 15:40:07,403 INFO L226 Difference]: Without dead ends: 206 [2018-01-24 15:40:07,404 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:40:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-24 15:40:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-01-24 15:40:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-24 15:40:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions. [2018-01-24 15:40:07,423 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 7 [2018-01-24 15:40:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:40:07,424 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions. [2018-01-24 15:40:07,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:40:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions. [2018-01-24 15:40:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:40:07,424 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:40:07,425 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:40:07,425 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-24 15:40:07,425 INFO L82 PathProgramCache]: Analyzing trace with hash 627159801, now seen corresponding path program 1 times [2018-01-24 15:40:07,425 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:40:07,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:07,426 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:40:07,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:07,426 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:40:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:40:07,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:40:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:40:07,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:40:07,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:40:07,541 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:40:07,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:40:07,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:40:07,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:40:07,542 INFO L87 Difference]: Start difference. First operand 204 states and 216 transitions. Second operand 5 states. [2018-01-24 15:40:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:40:07,994 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2018-01-24 15:40:07,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:40:07,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 15:40:07,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:40:07,995 INFO L225 Difference]: With dead ends: 204 [2018-01-24 15:40:07,995 INFO L226 Difference]: Without dead ends: 202 [2018-01-24 15:40:07,996 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:40:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-24 15:40:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-01-24 15:40:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-01-24 15:40:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 214 transitions. [2018-01-24 15:40:08,010 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 214 transitions. Word has length 14 [2018-01-24 15:40:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:40:08,010 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 214 transitions. [2018-01-24 15:40:08,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:40:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 214 transitions. [2018-01-24 15:40:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:40:08,011 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:40:08,011 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:40:08,011 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-24 15:40:08,011 INFO L82 PathProgramCache]: Analyzing trace with hash 627159802, now seen corresponding path program 1 times [2018-01-24 15:40:08,011 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:40:08,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:08,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:40:08,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:08,012 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:40:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:40:08,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:40:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:40:08,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:40:08,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:40:08,151 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:40:08,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:40:08,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:40:08,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:40:08,153 INFO L87 Difference]: Start difference. First operand 202 states and 214 transitions. Second operand 7 states. [2018-01-24 15:40:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:40:08,581 INFO L93 Difference]: Finished difference Result 224 states and 240 transitions. [2018-01-24 15:40:08,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:40:08,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-24 15:40:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:40:08,584 INFO L225 Difference]: With dead ends: 224 [2018-01-24 15:40:08,584 INFO L226 Difference]: Without dead ends: 222 [2018-01-24 15:40:08,585 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:40:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-24 15:40:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 211. [2018-01-24 15:40:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-24 15:40:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 226 transitions. [2018-01-24 15:40:08,599 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 226 transitions. Word has length 14 [2018-01-24 15:40:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:40:08,599 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 226 transitions. [2018-01-24 15:40:08,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:40:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2018-01-24 15:40:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:40:08,600 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:40:08,600 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:40:08,601 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-24 15:40:08,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2032882424, now seen corresponding path program 1 times [2018-01-24 15:40:08,601 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:40:08,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:08,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:40:08,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:08,603 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:40:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:40:08,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:40:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:40:08,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:40:08,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:40:08,658 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:40:08,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:40:08,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:40:08,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:40:08,660 INFO L87 Difference]: Start difference. First operand 211 states and 226 transitions. Second operand 4 states. [2018-01-24 15:40:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:40:08,831 INFO L93 Difference]: Finished difference Result 211 states and 226 transitions. [2018-01-24 15:40:08,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:40:08,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 15:40:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:40:08,833 INFO L225 Difference]: With dead ends: 211 [2018-01-24 15:40:08,833 INFO L226 Difference]: Without dead ends: 209 [2018-01-24 15:40:08,833 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:40:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-24 15:40:08,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-01-24 15:40:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-24 15:40:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 223 transitions. [2018-01-24 15:40:08,844 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 223 transitions. Word has length 15 [2018-01-24 15:40:08,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:40:08,845 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 223 transitions. [2018-01-24 15:40:08,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:40:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 223 transitions. [2018-01-24 15:40:08,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:40:08,845 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:40:08,845 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:40:08,846 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-24 15:40:08,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2032882423, now seen corresponding path program 1 times [2018-01-24 15:40:08,846 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:40:08,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:08,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:40:08,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:08,847 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:40:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:40:08,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:40:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:40:08,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:40:08,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:40:08,898 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:40:08,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:40:08,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:40:08,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:40:08,898 INFO L87 Difference]: Start difference. First operand 209 states and 223 transitions. Second operand 4 states. [2018-01-24 15:40:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:40:09,059 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2018-01-24 15:40:09,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:40:09,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 15:40:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:40:09,061 INFO L225 Difference]: With dead ends: 209 [2018-01-24 15:40:09,061 INFO L226 Difference]: Without dead ends: 207 [2018-01-24 15:40:09,062 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:40:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-24 15:40:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-01-24 15:40:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-01-24 15:40:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 220 transitions. [2018-01-24 15:40:09,072 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 220 transitions. Word has length 15 [2018-01-24 15:40:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:40:09,072 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 220 transitions. [2018-01-24 15:40:09,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:40:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 220 transitions. [2018-01-24 15:40:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 15:40:09,073 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:40:09,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-24 15:40:09,074 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-24 15:40:09,074 INFO L82 PathProgramCache]: Analyzing trace with hash -290527541, now seen corresponding path program 1 times [2018-01-24 15:40:09,074 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:40:09,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:09,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:40:09,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:09,075 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:40:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:40:09,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:40:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:40:09,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:40:09,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 15:40:09,358 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:40:09,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:40:09,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:40:09,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:40:09,359 INFO L87 Difference]: Start difference. First operand 207 states and 220 transitions. Second operand 13 states. [2018-01-24 15:40:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:40:10,497 INFO L93 Difference]: Finished difference Result 399 states and 427 transitions. [2018-01-24 15:40:10,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 15:40:10,497 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-01-24 15:40:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:40:10,499 INFO L225 Difference]: With dead ends: 399 [2018-01-24 15:40:10,499 INFO L226 Difference]: Without dead ends: 209 [2018-01-24 15:40:10,501 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-24 15:40:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-24 15:40:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2018-01-24 15:40:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-24 15:40:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions. [2018-01-24 15:40:10,510 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 20 [2018-01-24 15:40:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:40:10,511 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions. [2018-01-24 15:40:10,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:40:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2018-01-24 15:40:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 15:40:10,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:40:10,512 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-24 15:40:10,512 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-24 15:40:10,512 INFO L82 PathProgramCache]: Analyzing trace with hash -30107462, now seen corresponding path program 1 times [2018-01-24 15:40:10,512 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:40:10,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:10,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:40:10,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:10,514 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:40:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:40:10,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:40:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:40:10,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:40:10,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:40:10,572 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:40:10,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:40:10,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:40:10,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:40:10,573 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 4 states. [2018-01-24 15:40:10,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:40:10,661 INFO L93 Difference]: Finished difference Result 484 states and 520 transitions. [2018-01-24 15:40:10,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:40:10,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 15:40:10,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:40:10,663 INFO L225 Difference]: With dead ends: 484 [2018-01-24 15:40:10,663 INFO L226 Difference]: Without dead ends: 294 [2018-01-24 15:40:10,664 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-24 15:40:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-01-24 15:40:10,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 258. [2018-01-24 15:40:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-01-24 15:40:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 311 transitions. [2018-01-24 15:40:10,673 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 311 transitions. Word has length 22 [2018-01-24 15:40:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:40:10,673 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 311 transitions. [2018-01-24 15:40:10,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:40:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 311 transitions. [2018-01-24 15:40:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:40:10,674 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:40:10,674 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-24 15:40:10,674 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-24 15:40:10,674 INFO L82 PathProgramCache]: Analyzing trace with hash 929227204, now seen corresponding path program 1 times [2018-01-24 15:40:10,674 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:40:10,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:10,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:40:10,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:10,675 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:40:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:40:10,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:40:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:40:10,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:40:10,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:40:10,746 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:40:10,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:40:10,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:40:10,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:40:10,747 INFO L87 Difference]: Start difference. First operand 258 states and 311 transitions. Second operand 4 states. [2018-01-24 15:40:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:40:11,070 INFO L93 Difference]: Finished difference Result 260 states and 313 transitions. [2018-01-24 15:40:11,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:40:11,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-24 15:40:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:40:11,073 INFO L225 Difference]: With dead ends: 260 [2018-01-24 15:40:11,073 INFO L226 Difference]: Without dead ends: 245 [2018-01-24 15:40:11,074 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-24 15:40:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-01-24 15:40:11,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-01-24 15:40:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-24 15:40:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 281 transitions. [2018-01-24 15:40:11,087 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 281 transitions. Word has length 26 [2018-01-24 15:40:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:40:11,087 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 281 transitions. [2018-01-24 15:40:11,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:40:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 281 transitions. [2018-01-24 15:40:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:40:11,088 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:40:11,089 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-24 15:40:11,089 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-24 15:40:11,089 INFO L82 PathProgramCache]: Analyzing trace with hash 929227205, now seen corresponding path program 1 times [2018-01-24 15:40:11,089 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:40:11,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:11,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:40:11,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:11,091 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:40:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:40:11,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:40:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:40:11,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:40:11,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:40:11,162 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:40:11,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:40:11,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:40:11,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:40:11,163 INFO L87 Difference]: Start difference. First operand 243 states and 281 transitions. Second operand 5 states. [2018-01-24 15:40:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:40:11,370 INFO L93 Difference]: Finished difference Result 245 states and 283 transitions. [2018-01-24 15:40:11,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:40:11,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 15:40:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:40:11,371 INFO L225 Difference]: With dead ends: 245 [2018-01-24 15:40:11,372 INFO L226 Difference]: Without dead ends: 230 [2018-01-24 15:40:11,372 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-24 15:40:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-24 15:40:11,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-01-24 15:40:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-24 15:40:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 251 transitions. [2018-01-24 15:40:11,383 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 251 transitions. Word has length 26 [2018-01-24 15:40:11,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:40:11,383 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 251 transitions. [2018-01-24 15:40:11,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:40:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 251 transitions. [2018-01-24 15:40:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:40:11,385 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:40:11,385 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-24 15:40:11,385 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-24 15:40:11,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2007437674, now seen corresponding path program 1 times [2018-01-24 15:40:11,385 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:40:11,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:11,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:40:11,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:11,387 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:40:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:40:11,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:40:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:40:11,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:40:11,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:40:11,444 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:40:11,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:40:11,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:40:11,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:40:11,445 INFO L87 Difference]: Start difference. First operand 228 states and 251 transitions. Second operand 5 states. [2018-01-24 15:40:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:40:11,784 INFO L93 Difference]: Finished difference Result 296 states and 333 transitions. [2018-01-24 15:40:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:40:11,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-24 15:40:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:40:11,785 INFO L225 Difference]: With dead ends: 296 [2018-01-24 15:40:11,785 INFO L226 Difference]: Without dead ends: 295 [2018-01-24 15:40:11,786 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-24 15:40:11,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-01-24 15:40:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 238. [2018-01-24 15:40:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-24 15:40:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 265 transitions. [2018-01-24 15:40:11,796 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 265 transitions. Word has length 32 [2018-01-24 15:40:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:40:11,797 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 265 transitions. [2018-01-24 15:40:11,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:40:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 265 transitions. [2018-01-24 15:40:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:40:11,798 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:40:11,798 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-24 15:40:11,798 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-24 15:40:11,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2007437675, now seen corresponding path program 1 times [2018-01-24 15:40:11,798 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:40:11,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:11,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:40:11,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:11,800 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:40:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:40:11,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:40:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:40:11,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:40:11,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:40:11,900 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:40:11,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:40:11,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:40:11,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:40:11,901 INFO L87 Difference]: Start difference. First operand 238 states and 265 transitions. Second operand 6 states. [2018-01-24 15:40:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:40:12,227 INFO L93 Difference]: Finished difference Result 466 states and 523 transitions. [2018-01-24 15:40:12,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:40:12,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-24 15:40:12,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:40:12,228 INFO L225 Difference]: With dead ends: 466 [2018-01-24 15:40:12,229 INFO L226 Difference]: Without dead ends: 246 [2018-01-24 15:40:12,229 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:40:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-01-24 15:40:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 238. [2018-01-24 15:40:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-24 15:40:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 261 transitions. [2018-01-24 15:40:12,239 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 261 transitions. Word has length 32 [2018-01-24 15:40:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:40:12,239 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 261 transitions. [2018-01-24 15:40:12,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:40:12,240 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 261 transitions. [2018-01-24 15:40:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 15:40:12,241 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:40:12,241 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-24 15:40:12,241 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-24 15:40:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2018693333, now seen corresponding path program 1 times [2018-01-24 15:40:12,242 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:40:12,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:12,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:40:12,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:40:12,243 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:40:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:40:12,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:40:12,544 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-24 15:40:12,545 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:40:12,545 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:40:12,545 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-24 15:40:12,547 INFO L201 CegarAbsIntRunner]: [0], [9], [18], [19], [20], [21], [22], [25], [29], [34], [35], [38], [39], [40], [42], [44], [137], [138], [141], [145], [244], [245], [249], [250], [251], [252], [255], [258], [259], [264], [288], [292], [293], [294], [296] [2018-01-24 15:40:12,597 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:40:12,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:40:24,472 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 15:40:24,474 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-24 15:40:24,484 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 15:40:32,631 INFO L232 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 76.84% of their original sizes. [2018-01-24 15:40:32,632 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 15:40:34,733 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse48 (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|) |c_main_~#list~14.offset|)) (.cse0 (select |c_old(#valid)| 0)) (.cse47 (select |c_old(#valid)| |c_main_~#list~14.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|) |c_main_~#list~14.offset|)) (.cse88 (select |c_#valid| 0))) (and (= |c_#NULL.base| |c_main_~#list~14.offset|) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)))) (= .cse0 .cse1) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)))) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (not (= v_weq0_1 |c_main_~#list~14.base|)) (not (= v_weq1_1 0)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse10 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse2 (select .cse10 v_weq1_1)) (.cse4 (select |c_#valid| 0)) (.cse3 (select .cse9 v_weq1_1)) (.cse6 (select .cse10 |c_main_~#list~14.offset|)) (.cse7 (select |c_old(#valid)| 0)) (.cse8 (select .cse9 |c_main_~#list~14.offset|))) (and (= |c_#NULL.offset| .cse2) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse3) (= .cse4 0) (= .cse2 |c_main_~#list~14.offset|) (let ((.cse5 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse5 v_weq1_1) (select .cse5 |c_main_~#list~14.offset|))) (= 0 .cse6) (= |c_#NULL.base| .cse4) (= .cse3 |c_#NULL.base|) (= .cse6 .cse7) (not (= |c_main_~#list~14.base| 0)) (= .cse7 v_weq1_1) (= v_weq1_1 .cse8) (= .cse8 |c_#NULL.offset|)))) (= (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)) (let ((.cse12 (select |c_#valid| v_weq0_1)) (.cse11 (select |c_old(#valid)| v_weq0_1))) (or (= .cse11 .cse12) (let ((.cse23 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|)) (.cse22 (select |c_#memory_$Pointer$.offset| v_weq0_1)) (.cse16 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|))) (let ((.cse14 (select .cse16 |c_main_~#list~14.offset|)) (.cse17 (select |c_#valid| 0)) (.cse13 (select |c_#memory_int| |c_main_~#list~14.base|)) (.cse20 (select .cse22 |c_main_~#list~14.offset|)) (.cse18 (select |c_old(#valid)| |c_main_~#list~14.base|)) (.cse19 (select .cse23 |c_main_~#list~14.offset|)) (.cse21 (select |c_old(#valid)| 0)) (.cse15 (select |c_#valid| |c_main_~#list~14.base|))) (and (= (select .cse13 |c_main_~#list~14.offset|) (select .cse13 .cse11)) (= (select |c_old(#memory_int)| |c_main_~#list~14.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse11 .cse14) (= |c_#NULL.base| |c_main_~#list~14.offset|) (= |c_main_~#list~14.base| v_weq0_1) (= .cse15 .cse12) (= (select |c_#memory_$Pointer$.base| v_weq0_1) .cse16) (= .cse14 .cse17) (= .cse18 .cse19) (= .cse17 |c_#NULL.offset|) (= 0 .cse20) (= (select |c_#memory_int| v_weq0_1) .cse13) (= .cse20 .cse18) (= |c_#NULL.offset| |c_#NULL.base|) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse19 .cse21) (= .cse21 .cse11) (= .cse22 .cse23) (= 1 .cse15) (= (select |c_#length| v_weq0_1) 4) (not (= v_weq0_1 0)) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|)))))))) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse25 (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (.cse24 (select |c_#memory_$Pointer$.base| v_weq0_1))) (or (= (select .cse24 v_weq1_1) (select .cse25 v_weq1_1)) (let ((.cse40 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse28 (select .cse40 v_weq1_1)) (.cse41 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|)) (.cse33 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse27 (select |c_#memory_int| v_weq0_1)) (.cse42 (select |c_old(#valid)| v_weq0_1)) (.cse36 (select |c_#memory_int| |c_main_~#list~14.base|))) (let ((.cse30 (select .cse36 v_weq1_1)) (.cse26 (select .cse27 .cse42)) (.cse29 (select .cse33 v_weq1_1)) (.cse39 (select |c_old(#valid)| 0)) (.cse43 (select .cse33 |c_main_~#list~14.offset|)) (.cse44 (select .cse40 |c_main_~#list~14.offset|)) (.cse35 (select |c_#valid| 0)) (.cse45 (select .cse41 v_weq1_1)) (.cse37 (select |c_#valid| v_weq0_1)) (.cse34 (select .cse36 .cse42)) (.cse31 (select .cse36 |c_main_~#list~14.offset|)) (.cse46 (select .cse36 .cse28)) (.cse32 (select .cse24 |c_main_~#list~14.offset|)) (.cse38 (select .cse41 |c_main_~#list~14.offset|))) (and (= .cse26 (select .cse27 |c_main_~#list~14.offset|)) (= .cse28 .cse29) (= (select |c_old(#memory_int)| |c_main_~#list~14.base|) (select |c_old(#memory_int)| v_weq0_1)) (= (select .cse27 .cse28) .cse30) (= |c_main_~#list~14.base| v_weq0_1) (= .cse30 .cse31) (= 0 .cse32) (= .cse24 .cse33) (= .cse34 .cse26) (= |c_#NULL.base| .cse35) (= .cse29 |c_#NULL.base|) (= .cse27 .cse36) (not (= 0 v_weq0_1)) (= .cse37 (select |c_#valid| |c_main_~#list~14.base|)) (= .cse38 .cse39) (= .cse40 .cse41) (= (select |c_#length| v_weq0_1) 4) (= .cse42 .cse28) (= .cse39 v_weq1_1) (= v_weq1_1 .cse43) (= .cse43 |c_#NULL.offset|) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|)) (= .cse44 .cse42) (= |c_#NULL.offset| .cse45) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse44) (= .cse35 0) (= .cse45 |c_main_~#list~14.offset|) (= 1 .cse37) (= .cse46 .cse34) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) .cse25) (= .cse31 .cse46) (= .cse32 .cse38)))))))) (= .cse47 .cse48) (forall ((v_weq0_1 Int)) (or (let ((.cse56 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse57 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse49 (select .cse57 v_weq0_1)) (.cse50 (select |c_#valid| 0)) (.cse52 (select .cse56 v_weq0_1)) (.cse53 (select .cse57 |c_main_~#list~14.offset|)) (.cse55 (select |c_old(#valid)| 0)) (.cse54 (select .cse56 |c_main_~#list~14.offset|))) (and (= .cse49 |c_#NULL.base|) (= .cse50 0) (let ((.cse51 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse51 |c_main_~#list~14.offset|) (select .cse51 v_weq0_1))) (= .cse52 .cse49) (= 0 .cse53) (= |c_#NULL.base| .cse50) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse52) (= v_weq0_1 .cse54) (= .cse55 v_weq0_1) (= .cse53 .cse55) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse54 |c_#NULL.offset|)))) (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.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)) (let ((.cse59 (select |c_#memory_int| v_weq0_1))) (let ((.cse77 (select .cse59 v_weq1_1)) (.cse58 (select |c_old(#memory_int)| v_weq0_1))) (or (let ((.cse73 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse74 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|)) (.cse60 (select .cse73 v_weq1_1)) (.cse65 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse64 (select |c_#memory_$Pointer$.base| v_weq0_1)) (.cse68 (select |c_#memory_int| |c_main_~#list~14.base|))) (let ((.cse61 (select .cse68 v_weq1_1)) (.cse67 (select .cse64 v_weq1_1)) (.cse72 (select |c_old(#valid)| 0)) (.cse69 (select .cse65 |c_main_~#list~14.offset|)) (.cse75 (select |c_old(#valid)| v_weq0_1)) (.cse76 (select .cse73 |c_main_~#list~14.offset|)) (.cse66 (select |c_#valid| 0)) (.cse70 (select |c_#valid| v_weq0_1)) (.cse78 (select .cse68 .cse60)) (.cse62 (select .cse68 |c_main_~#list~14.offset|)) (.cse63 (select .cse64 |c_main_~#list~14.offset|)) (.cse71 (select .cse74 |c_main_~#list~14.offset|))) (and (= (select |c_old(#memory_int)| |c_main_~#list~14.base|) .cse58) (= (select .cse59 .cse60) .cse61) (= |c_main_~#list~14.base| v_weq0_1) (= .cse61 .cse62) (= 0 .cse63) (= .cse64 .cse65) (= |c_#NULL.base| .cse66) (= v_weq1_1 .cse67) (= .cse59 .cse68) (= .cse67 .cse69) (not (= 0 v_weq0_1)) (= .cse70 (select |c_#valid| |c_main_~#list~14.base|)) (= .cse71 .cse72) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (= .cse73 .cse74) (= (select |c_#length| v_weq0_1) 4) (= .cse75 .cse60) (= .cse72 v_weq1_1) (= .cse69 |c_#NULL.offset|) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|)) (= .cse76 .cse75) (= .cse77 .cse78) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse76) (= .cse66 0) (= 1 .cse70) (= .cse60 |c_#NULL.base|) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse78 (select .cse59 |c_main_~#list~14.offset|)) (= .cse62 .cse77) (= .cse63 .cse71))))) (= .cse77 (select .cse58 v_weq1_1)))))) (forall ((v_weq0_1 Int)) (or (let ((.cse86 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse87 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse79 (select .cse87 v_weq0_1)) (.cse80 (select |c_#valid| 0)) (.cse82 (select .cse86 v_weq0_1)) (.cse83 (select .cse87 |c_main_~#list~14.offset|)) (.cse85 (select |c_old(#valid)| 0)) (.cse84 (select .cse86 |c_main_~#list~14.offset|))) (and (= .cse79 |c_#NULL.base|) (= .cse80 0) (let ((.cse81 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse81 |c_main_~#list~14.offset|) (select .cse81 v_weq0_1))) (= .cse82 .cse79) (= 0 .cse83) (= |c_#NULL.base| .cse80) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse82) (= v_weq0_1 .cse84) (= .cse85 v_weq0_1) (= .cse83 .cse85) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse84 |c_#NULL.offset|)))) (= (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)))) (= .cse88 |c_#NULL.offset|) (forall ((v_weq0_1 Int)) (let ((.cse101 (select |c_#length| v_weq0_1))) (or (let ((.cse100 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|)) (.cse99 (select |c_#memory_$Pointer$.offset| v_weq0_1)) (.cse93 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|))) (let ((.cse91 (select .cse93 |c_main_~#list~14.offset|)) (.cse94 (select |c_#valid| 0)) (.cse89 (select |c_#memory_int| |c_main_~#list~14.base|)) (.cse97 (select .cse99 |c_main_~#list~14.offset|)) (.cse95 (select |c_old(#valid)| |c_main_~#list~14.base|)) (.cse96 (select .cse100 |c_main_~#list~14.offset|)) (.cse98 (select |c_old(#valid)| 0)) (.cse90 (select |c_old(#valid)| v_weq0_1)) (.cse92 (select |c_#valid| |c_main_~#list~14.base|))) (and (= (select .cse89 |c_main_~#list~14.offset|) (select .cse89 .cse90)) (= (select |c_old(#memory_int)| |c_main_~#list~14.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse90 .cse91) (= |c_#NULL.base| |c_main_~#list~14.offset|) (= |c_main_~#list~14.base| v_weq0_1) (= .cse92 (select |c_#valid| v_weq0_1)) (= (select |c_#memory_$Pointer$.base| v_weq0_1) .cse93) (= .cse91 .cse94) (= .cse95 .cse96) (= .cse94 |c_#NULL.offset|) (= 0 .cse97) (= (select |c_#memory_int| v_weq0_1) .cse89) (= .cse97 .cse95) (= |c_#NULL.offset| |c_#NULL.base|) (not (= 0 v_weq0_1)) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse96 .cse98) (= .cse98 .cse90) (= .cse99 .cse100) (= 1 .cse92) (= .cse101 4) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|))))) (= .cse101 (select |c_old(#length)| v_weq0_1))))) (forall ((v_weq0_1 Int)) (or (let ((.cse109 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse110 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse102 (select .cse110 v_weq0_1)) (.cse103 (select |c_#valid| 0)) (.cse105 (select .cse109 v_weq0_1)) (.cse106 (select .cse110 |c_main_~#list~14.offset|)) (.cse108 (select |c_old(#valid)| 0)) (.cse107 (select .cse109 |c_main_~#list~14.offset|))) (and (= .cse102 |c_#NULL.base|) (= .cse103 0) (let ((.cse104 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse104 |c_main_~#list~14.offset|) (select .cse104 v_weq0_1))) (= .cse105 .cse102) (= 0 .cse106) (= |c_#NULL.base| .cse103) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse105) (= v_weq0_1 .cse107) (= .cse108 v_weq0_1) (= .cse106 .cse108) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse107 |c_#NULL.offset|)))) (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)))) (= |c_#NULL.offset| |c_#NULL.base|) (forall ((v_weq0_1 Int)) (or (let ((.cse118 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse119 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse111 (select .cse119 v_weq0_1)) (.cse112 (select |c_#valid| 0)) (.cse114 (select .cse118 v_weq0_1)) (.cse115 (select .cse119 |c_main_~#list~14.offset|)) (.cse117 (select |c_old(#valid)| 0)) (.cse116 (select .cse118 |c_main_~#list~14.offset|))) (and (= .cse111 |c_#NULL.base|) (= .cse112 0) (let ((.cse113 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse113 |c_main_~#list~14.offset|) (select .cse113 v_weq0_1))) (= .cse114 .cse111) (= 0 .cse115) (= |c_#NULL.base| .cse112) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse114) (= v_weq0_1 .cse116) (= .cse117 v_weq0_1) (= .cse115 .cse117) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse116 |c_#NULL.offset|)))) (not (= v_weq0_1 0)) (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) v_weq0_1) (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|) v_weq0_1)))) (= .cse48 .cse0) (not (= |c_#valid| |c_#length|)) (= 1 (select |c_#valid| |c_main_~#list~14.base|)) (forall ((v_weq0_1 Int)) (let ((.cse127 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|))) (let ((.cse123 (select .cse127 v_weq0_1))) (or (let ((.cse128 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse120 (select .cse128 v_weq0_1)) (.cse121 (select |c_#valid| 0)) (.cse124 (select .cse128 |c_main_~#list~14.offset|)) (.cse126 (select |c_old(#valid)| 0)) (.cse125 (select .cse127 |c_main_~#list~14.offset|))) (and (= .cse120 |c_#NULL.base|) (= .cse121 0) (let ((.cse122 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse122 |c_main_~#list~14.offset|) (select .cse122 v_weq0_1))) (= .cse123 .cse120) (= 0 .cse124) (= |c_#NULL.base| .cse121) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse123) (= v_weq0_1 .cse125) (= .cse126 v_weq0_1) (= .cse124 .cse126) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse125 |c_#NULL.offset|)))) (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) v_weq0_1) .cse123))))) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)))) (forall ((v_weq0_1 Int)) (let ((.cse136 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|))) (let ((.cse132 (select .cse136 v_weq0_1))) (or (let ((.cse137 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse129 (select .cse137 v_weq0_1)) (.cse130 (select |c_#valid| 0)) (.cse133 (select .cse137 |c_main_~#list~14.offset|)) (.cse135 (select |c_old(#valid)| 0)) (.cse134 (select .cse136 |c_main_~#list~14.offset|))) (and (= .cse129 |c_#NULL.base|) (= .cse130 0) (let ((.cse131 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse131 |c_main_~#list~14.offset|) (select .cse131 v_weq0_1))) (= .cse132 .cse129) (= 0 .cse133) (= |c_#NULL.base| .cse130) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse132) (= v_weq0_1 .cse134) (= .cse135 v_weq0_1) (= .cse133 .cse135) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse134 |c_#NULL.offset|)))) (= (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|) v_weq0_1) .cse132) (not (= v_weq0_1 0)))))) (= 0 .cse47) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (not (= |c_#length| |c_old(#valid)|)) (forall ((v_weq0_1 Int)) (let ((.cse140 (select |c_#memory_int| |c_main_~#list~14.base|))) (let ((.cse141 (select .cse140 v_weq0_1))) (or (let ((.cse146 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse147 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse138 (select .cse147 v_weq0_1)) (.cse139 (select |c_#valid| 0)) (.cse142 (select .cse146 v_weq0_1)) (.cse143 (select .cse147 |c_main_~#list~14.offset|)) (.cse145 (select |c_old(#valid)| 0)) (.cse144 (select .cse146 |c_main_~#list~14.offset|))) (and (= .cse138 |c_#NULL.base|) (= .cse139 0) (= (select .cse140 |c_main_~#list~14.offset|) .cse141) (= .cse142 .cse138) (= 0 .cse143) (= |c_#NULL.base| .cse139) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse142) (= v_weq0_1 .cse144) (= .cse145 v_weq0_1) (= .cse143 .cse145) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse144 |c_#NULL.offset|)))) (= .cse141 (select (select |c_old(#memory_int)| |c_main_~#list~14.base|) v_weq0_1)))))) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 0)) (= (select (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)))) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse164 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse148 (select |c_old(#memory_$Pointer$.offset)| v_weq0_1)) (.cse149 (select .cse164 v_weq1_1))) (or (= (select .cse148 v_weq1_1) .cse149) (let ((.cse151 (select |c_#memory_int| v_weq0_1)) (.cse165 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|)) (.cse155 (select |c_#memory_$Pointer$.base| v_weq0_1)) (.cse156 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse159 (select |c_#memory_int| |c_main_~#list~14.base|))) (let ((.cse152 (select .cse159 v_weq1_1)) (.cse150 (select .cse156 v_weq1_1)) (.cse158 (select .cse155 v_weq1_1)) (.cse163 (select |c_old(#valid)| 0)) (.cse160 (select .cse156 |c_main_~#list~14.offset|)) (.cse166 (select |c_old(#valid)| v_weq0_1)) (.cse167 (select .cse164 |c_main_~#list~14.offset|)) (.cse157 (select |c_#valid| 0)) (.cse168 (select .cse165 v_weq1_1)) (.cse161 (select |c_#valid| v_weq0_1)) (.cse170 (select .cse159 .cse149)) (.cse153 (select .cse159 |c_main_~#list~14.offset|)) (.cse169 (select .cse151 v_weq1_1)) (.cse154 (select .cse155 |c_main_~#list~14.offset|)) (.cse162 (select .cse165 |c_main_~#list~14.offset|))) (and (= .cse149 .cse150) (= (select |c_old(#memory_int)| |c_main_~#list~14.base|) (select |c_old(#memory_int)| v_weq0_1)) (= (select .cse151 .cse149) .cse152) (= |c_main_~#list~14.base| v_weq0_1) (= .cse152 .cse153) (= 0 .cse154) (= .cse155 .cse156) (= |c_#NULL.base| .cse157) (= .cse150 |c_#NULL.base|) (= v_weq1_1 .cse158) (= .cse151 .cse159) (= .cse158 .cse160) (not (= 0 v_weq0_1)) (= .cse161 (select |c_#valid| |c_main_~#list~14.base|)) (= .cse162 .cse163) (= .cse164 .cse165) (= (select |c_#length| v_weq0_1) 4) (= .cse166 .cse149) (= .cse163 v_weq1_1) (= .cse160 |c_#NULL.offset|) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (= .cse148 (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|)) (= .cse167 .cse166) (= |c_#NULL.offset| .cse168) (= .cse169 .cse170) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse167) (= .cse157 0) (= .cse168 |c_main_~#list~14.offset|) (= 1 .cse161) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse170 (select .cse151 |c_main_~#list~14.offset|)) (= .cse153 .cse169) (= .cse154 .cse162)))))))) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (not (= v_weq0_1 |c_main_~#list~14.base|)) (not (= v_weq1_1 0)) (let ((.cse178 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse179 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse171 (select .cse179 v_weq1_1)) (.cse173 (select |c_#valid| 0)) (.cse172 (select .cse178 v_weq1_1)) (.cse175 (select .cse179 |c_main_~#list~14.offset|)) (.cse176 (select |c_old(#valid)| 0)) (.cse177 (select .cse178 |c_main_~#list~14.offset|))) (and (= |c_#NULL.offset| .cse171) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse172) (= .cse173 0) (= .cse171 |c_main_~#list~14.offset|) (let ((.cse174 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse174 v_weq1_1) (select .cse174 |c_main_~#list~14.offset|))) (= 0 .cse175) (= |c_#NULL.base| .cse173) (= .cse172 |c_#NULL.base|) (= .cse175 .cse176) (not (= |c_main_~#list~14.base| 0)) (= .cse176 v_weq1_1) (= v_weq1_1 .cse177) (= .cse177 |c_#NULL.offset|)))) (= (select (select |c_#memory_$Pointer$.base| v_weq0_1) v_weq1_1) (select (select |c_#memory_$Pointer$.offset| v_weq0_1) v_weq1_1)))) (not (= 0 |c_main_~#list~14.base|)) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (not (= v_weq0_1 |c_main_~#list~14.base|)) (= (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)) (let ((.cse187 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse188 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse180 (select .cse188 v_weq1_1)) (.cse182 (select |c_#valid| 0)) (.cse181 (select .cse187 v_weq1_1)) (.cse184 (select .cse188 |c_main_~#list~14.offset|)) (.cse185 (select |c_old(#valid)| 0)) (.cse186 (select .cse187 |c_main_~#list~14.offset|))) (and (= |c_#NULL.offset| .cse180) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse181) (= .cse182 0) (= .cse180 |c_main_~#list~14.offset|) (let ((.cse183 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse183 v_weq1_1) (select .cse183 |c_main_~#list~14.offset|))) (= 0 .cse184) (= |c_#NULL.base| .cse182) (= .cse181 |c_#NULL.base|) (= .cse184 .cse185) (not (= |c_main_~#list~14.base| 0)) (= .cse185 v_weq1_1) (= v_weq1_1 .cse186) (= .cse186 |c_#NULL.offset|)))))) (forall ((v_weq0_1 Int)) (let ((.cse197 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse189 (select .cse197 v_weq0_1))) (or (let ((.cse196 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|))) (let ((.cse190 (select |c_#valid| 0)) (.cse192 (select .cse196 v_weq0_1)) (.cse193 (select .cse197 |c_main_~#list~14.offset|)) (.cse195 (select |c_old(#valid)| 0)) (.cse194 (select .cse196 |c_main_~#list~14.offset|))) (and (= .cse189 |c_#NULL.base|) (= .cse190 0) (let ((.cse191 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse191 |c_main_~#list~14.offset|) (select .cse191 v_weq0_1))) (= .cse192 .cse189) (= 0 .cse193) (= |c_#NULL.base| .cse190) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse192) (= v_weq0_1 .cse194) (= .cse195 v_weq0_1) (= .cse193 .cse195) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse194 |c_#NULL.offset|)))) (not (= v_weq0_1 0)) (= .cse189 (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) v_weq0_1)))))) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (not (= v_weq0_1 |c_main_~#list~14.base|)) (not (= v_weq1_1 0)) (let ((.cse205 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse206 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse198 (select .cse206 v_weq1_1)) (.cse200 (select |c_#valid| 0)) (.cse199 (select .cse205 v_weq1_1)) (.cse202 (select .cse206 |c_main_~#list~14.offset|)) (.cse203 (select |c_old(#valid)| 0)) (.cse204 (select .cse205 |c_main_~#list~14.offset|))) (and (= |c_#NULL.offset| .cse198) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse199) (= .cse200 0) (= .cse198 |c_main_~#list~14.offset|) (let ((.cse201 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse201 v_weq1_1) (select .cse201 |c_main_~#list~14.offset|))) (= 0 .cse202) (= |c_#NULL.base| .cse200) (= .cse199 |c_#NULL.base|) (= .cse202 .cse203) (not (= |c_main_~#list~14.base| 0)) (= .cse203 v_weq1_1) (= v_weq1_1 .cse204) (= .cse204 |c_#NULL.offset|)))) (= (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)))) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|) v_weq0_1) (select (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|) v_weq0_1)))) (= .cse1 .cse88) (forall ((v_weq0_1 Int)) (or (let ((.cse214 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse215 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse207 (select .cse215 v_weq0_1)) (.cse208 (select |c_#valid| 0)) (.cse210 (select .cse214 v_weq0_1)) (.cse211 (select .cse215 |c_main_~#list~14.offset|)) (.cse213 (select |c_old(#valid)| 0)) (.cse212 (select .cse214 |c_main_~#list~14.offset|))) (and (= .cse207 |c_#NULL.base|) (= .cse208 0) (let ((.cse209 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse209 |c_main_~#list~14.offset|) (select .cse209 v_weq0_1))) (= .cse210 .cse207) (= 0 .cse211) (= |c_#NULL.base| .cse208) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse210) (= v_weq0_1 .cse212) (= .cse213 v_weq0_1) (= .cse211 .cse213) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse212 |c_#NULL.offset|)))) (= (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)) (not (= v_weq0_1 0)))) (forall ((v_weq0_1 Int)) (let ((.cse224 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse216 (select .cse224 v_weq0_1))) (or (let ((.cse223 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|))) (let ((.cse217 (select |c_#valid| 0)) (.cse219 (select .cse223 v_weq0_1)) (.cse220 (select .cse224 |c_main_~#list~14.offset|)) (.cse222 (select |c_old(#valid)| 0)) (.cse221 (select .cse223 |c_main_~#list~14.offset|))) (and (= .cse216 |c_#NULL.base|) (= .cse217 0) (let ((.cse218 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse218 |c_main_~#list~14.offset|) (select .cse218 v_weq0_1))) (= .cse219 .cse216) (= 0 .cse220) (= |c_#NULL.base| .cse217) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse219) (= v_weq0_1 .cse221) (= .cse222 v_weq0_1) (= .cse220 .cse222) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse221 |c_#NULL.offset|)))) (= .cse216 (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|) v_weq0_1)))))) (not (= |c_#valid| |c_old(#valid)|)))) is different from false [2018-01-24 15:40:35,033 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse66 (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|) |c_main_~#list~14.offset|)) (.cse68 (select |c_old(#valid)| 0)) (.cse65 (select |c_old(#valid)| |c_main_~#list~14.base|)) (.cse67 (select |c_#valid| 0)) (.cse187 (select (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|) |c_main_~#list~14.offset|))) (and (forall ((v_weq0_1 Int)) (or (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse8 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse0 (select .cse8 v_weq0_1)) (.cse1 (select |c_#valid| 0)) (.cse3 (select .cse7 v_weq0_1)) (.cse4 (select .cse8 |c_main_~#list~14.offset|)) (.cse5 (select |c_old(#valid)| 0)) (.cse6 (select .cse7 |c_main_~#list~14.offset|))) (and (= .cse0 |c_#NULL.base|) (= .cse1 0) (let ((.cse2 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse2 |c_main_~#list~14.offset|) (select .cse2 v_weq0_1))) (= .cse3 .cse0) (= 0 .cse4) (= c_main_~dataNotFinished~14 v_weq0_1) (= |c_#NULL.base| .cse1) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse3) (= .cse5 c_main_~dataNotFinished~14) (= v_weq0_1 .cse6) (= .cse4 .cse5) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse6 |c_#NULL.offset|)))) (= (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.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 ((.cse27 (select |c_old(#memory_$Pointer$.offset)| v_weq0_1)) (.cse32 (select |c_old(#memory_$Pointer$.base)| v_weq0_1))) (or (not (= v_weq0_1 |c_main_~#list~14.base|)) (let ((.cse23 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse11 (select |c_#memory_int| v_weq0_1)) (.cse9 (select .cse23 v_weq1_1)) (.cse24 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|)) (.cse16 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse15 (select |c_#memory_$Pointer$.base| v_weq0_1)) (.cse20 (select |c_#memory_int| |c_main_~#list~14.base|))) (let ((.cse12 (select .cse20 v_weq1_1)) (.cse18 (select |c_#valid| 0)) (.cse19 (select .cse15 |c_main_~#list~14.offset|)) (.cse10 (select .cse16 v_weq1_1)) (.cse17 (select .cse15 v_weq1_1)) (.cse13 (select |c_#valid| |c_main_~#list~14.base|)) (.cse22 (select |c_old(#valid)| 0)) (.cse28 (select .cse24 v_weq1_1)) (.cse21 (select .cse24 |c_main_~#list~14.offset|)) (.cse30 (select .cse20 .cse9)) (.cse26 (select .cse16 |c_main_~#list~14.offset|)) (.cse31 (select |c_old(#valid)| |c_main_~#list~14.base|)) (.cse25 (select |c_old(#valid)| v_weq0_1)) (.cse14 (select .cse20 |c_main_~#list~14.offset|)) (.cse29 (select .cse11 v_weq1_1))) (and (= .cse9 .cse10) (= (select |c_old(#memory_int)| |c_main_~#list~14.base|) (select |c_old(#memory_int)| v_weq0_1)) (= (select .cse11 .cse9) .cse12) (= |c_main_~#list~14.base| v_weq0_1) (= .cse13 (select |c_#valid| v_weq0_1)) (= .cse12 .cse14) (= .cse15 .cse16) (= .cse17 c_main_~dataNotFinished~14) (= .cse18 .cse19) (= |c_#NULL.base| .cse18) (= .cse19 0) (= .cse10 |c_#NULL.base|) (= v_weq1_1 .cse17) (= .cse11 .cse20) (= .cse21 .cse22) (= .cse23 .cse24) (= 1 .cse13) (= (select |c_#length| v_weq0_1) 4) (= .cse25 .cse9) (= .cse22 v_weq1_1) (not (= v_weq0_1 0)) (= .cse26 |c_#NULL.offset|) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (= .cse27 (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|)) (= |c_#NULL.offset| .cse28) (= .cse29 .cse30) (= .cse28 |c_main_~#list~14.offset|) (= 0 .cse21) (= (select .cse23 |c_main_~#list~14.offset|) .cse31) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) .cse32) (= .cse30 (select .cse11 |c_main_~#list~14.offset|)) (= c_main_~dataNotFinished~14 .cse26) (= .cse31 .cse25) (= .cse14 .cse29))))) (not (= v_weq1_1 0)) (= (select .cse27 v_weq1_1) (select .cse32 v_weq1_1))))) (forall ((v_weq0_1 Int)) (or (let ((.cse40 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse41 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse33 (select .cse41 v_weq0_1)) (.cse34 (select |c_#valid| 0)) (.cse36 (select .cse40 v_weq0_1)) (.cse37 (select .cse41 |c_main_~#list~14.offset|)) (.cse38 (select |c_old(#valid)| 0)) (.cse39 (select .cse40 |c_main_~#list~14.offset|))) (and (= .cse33 |c_#NULL.base|) (= .cse34 0) (let ((.cse35 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse35 |c_main_~#list~14.offset|) (select .cse35 v_weq0_1))) (= .cse36 .cse33) (= 0 .cse37) (= c_main_~dataNotFinished~14 v_weq0_1) (= |c_#NULL.base| .cse34) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse36) (= .cse38 c_main_~dataNotFinished~14) (= v_weq0_1 .cse39) (= .cse37 .cse38) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse39 |c_#NULL.offset|)))) (= (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)) (not (= v_weq0_1 0)))) (= |c_#NULL.base| |c_main_~#list~14.offset|) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse57 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse42 (select |c_old(#memory_$Pointer$.offset)| v_weq0_1)) (.cse43 (select .cse57 v_weq1_1))) (or (= (select .cse42 v_weq1_1) .cse43) (let ((.cse45 (select |c_#memory_int| v_weq0_1)) (.cse58 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|)) (.cse50 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse49 (select |c_#memory_$Pointer$.base| v_weq0_1)) (.cse54 (select |c_#memory_int| |c_main_~#list~14.base|))) (let ((.cse46 (select .cse54 v_weq1_1)) (.cse52 (select |c_#valid| 0)) (.cse53 (select .cse49 |c_main_~#list~14.offset|)) (.cse44 (select .cse50 v_weq1_1)) (.cse51 (select .cse49 v_weq1_1)) (.cse47 (select |c_#valid| |c_main_~#list~14.base|)) (.cse56 (select |c_old(#valid)| 0)) (.cse61 (select .cse58 v_weq1_1)) (.cse55 (select .cse58 |c_main_~#list~14.offset|)) (.cse63 (select .cse54 .cse43)) (.cse60 (select .cse50 |c_main_~#list~14.offset|)) (.cse64 (select |c_old(#valid)| |c_main_~#list~14.base|)) (.cse59 (select |c_old(#valid)| v_weq0_1)) (.cse48 (select .cse54 |c_main_~#list~14.offset|)) (.cse62 (select .cse45 v_weq1_1))) (and (= .cse43 .cse44) (= (select |c_old(#memory_int)| |c_main_~#list~14.base|) (select |c_old(#memory_int)| v_weq0_1)) (= (select .cse45 .cse43) .cse46) (= |c_main_~#list~14.base| v_weq0_1) (= .cse47 (select |c_#valid| v_weq0_1)) (= .cse46 .cse48) (= .cse49 .cse50) (= .cse51 c_main_~dataNotFinished~14) (= .cse52 .cse53) (= |c_#NULL.base| .cse52) (= .cse53 0) (= .cse44 |c_#NULL.base|) (= v_weq1_1 .cse51) (= .cse45 .cse54) (= .cse55 .cse56) (= .cse57 .cse58) (= 1 .cse47) (= (select |c_#length| v_weq0_1) 4) (= .cse59 .cse43) (= .cse56 v_weq1_1) (not (= v_weq0_1 0)) (= .cse60 |c_#NULL.offset|) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (= .cse42 (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|)) (= |c_#NULL.offset| .cse61) (= .cse62 .cse63) (= .cse61 |c_main_~#list~14.offset|) (= 0 .cse55) (= (select .cse57 |c_main_~#list~14.offset|) .cse64) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse63 (select .cse45 |c_main_~#list~14.offset|)) (= c_main_~dataNotFinished~14 .cse60) (= .cse64 .cse59) (= .cse48 .cse62)))))))) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)))) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)))) (= .cse65 .cse66) (= .cse67 |c_#NULL.offset|) (= .cse68 c_main_~dataNotFinished~14) (= |c_#NULL.offset| |c_#NULL.base|) (forall ((v_weq0_1 Int)) (let ((.cse76 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|))) (let ((.cse72 (select .cse76 v_weq0_1))) (or (let ((.cse77 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse69 (select .cse77 v_weq0_1)) (.cse70 (select |c_#valid| 0)) (.cse73 (select .cse77 |c_main_~#list~14.offset|)) (.cse74 (select |c_old(#valid)| 0)) (.cse75 (select .cse76 |c_main_~#list~14.offset|))) (and (= .cse69 |c_#NULL.base|) (= .cse70 0) (let ((.cse71 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse71 |c_main_~#list~14.offset|) (select .cse71 v_weq0_1))) (= .cse72 .cse69) (= 0 .cse73) (= c_main_~dataNotFinished~14 v_weq0_1) (= |c_#NULL.base| .cse70) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse72) (= .cse74 c_main_~dataNotFinished~14) (= v_weq0_1 .cse75) (= .cse73 .cse74) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse75 |c_#NULL.offset|)))) (= (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|) v_weq0_1) .cse72) (not (= v_weq0_1 0)))))) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse93 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse79 (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (.cse78 (select .cse93 v_weq1_1))) (or (not (= v_weq0_1 |c_main_~#list~14.base|)) (= .cse78 (select .cse79 v_weq1_1)) (let ((.cse81 (select |c_#memory_int| v_weq0_1)) (.cse94 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|)) (.cse86 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse85 (select |c_#memory_$Pointer$.base| v_weq0_1)) (.cse90 (select |c_#memory_int| |c_main_~#list~14.base|))) (let ((.cse82 (select .cse90 v_weq1_1)) (.cse88 (select |c_#valid| 0)) (.cse89 (select .cse85 |c_main_~#list~14.offset|)) (.cse80 (select .cse86 v_weq1_1)) (.cse87 (select .cse85 v_weq1_1)) (.cse83 (select |c_#valid| |c_main_~#list~14.base|)) (.cse92 (select |c_old(#valid)| 0)) (.cse97 (select .cse94 v_weq1_1)) (.cse91 (select .cse94 |c_main_~#list~14.offset|)) (.cse99 (select .cse90 .cse78)) (.cse96 (select .cse86 |c_main_~#list~14.offset|)) (.cse100 (select |c_old(#valid)| |c_main_~#list~14.base|)) (.cse95 (select |c_old(#valid)| v_weq0_1)) (.cse84 (select .cse90 |c_main_~#list~14.offset|)) (.cse98 (select .cse81 v_weq1_1))) (and (= .cse78 .cse80) (= (select |c_old(#memory_int)| |c_main_~#list~14.base|) (select |c_old(#memory_int)| v_weq0_1)) (= (select .cse81 .cse78) .cse82) (= |c_main_~#list~14.base| v_weq0_1) (= .cse83 (select |c_#valid| v_weq0_1)) (= .cse82 .cse84) (= .cse85 .cse86) (= .cse87 c_main_~dataNotFinished~14) (= .cse88 .cse89) (= |c_#NULL.base| .cse88) (= .cse89 0) (= .cse80 |c_#NULL.base|) (= v_weq1_1 .cse87) (= .cse81 .cse90) (= .cse91 .cse92) (= .cse93 .cse94) (= 1 .cse83) (= (select |c_#length| v_weq0_1) 4) (= .cse95 .cse78) (= .cse92 v_weq1_1) (not (= v_weq0_1 0)) (= .cse96 |c_#NULL.offset|) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|)) (= |c_#NULL.offset| .cse97) (= .cse98 .cse99) (= .cse97 |c_main_~#list~14.offset|) (= 0 .cse91) (= (select .cse93 |c_main_~#list~14.offset|) .cse100) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) .cse79) (= .cse99 (select .cse81 |c_main_~#list~14.offset|)) (= c_main_~dataNotFinished~14 .cse96) (= .cse100 .cse95) (= .cse84 .cse98)))) (not (= v_weq1_1 0)))))) (= .cse66 .cse68) (not (= |c_#valid| |c_#length|)) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse107 (select |c_#memory_$Pointer$.base| v_weq0_1))) (let ((.cse119 (select |c_old(#memory_$Pointer$.offset)| v_weq0_1)) (.cse109 (select .cse107 v_weq1_1))) (or (not (= v_weq0_1 |c_main_~#list~14.base|)) (let ((.cse115 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse103 (select |c_#memory_int| v_weq0_1)) (.cse101 (select .cse115 v_weq1_1)) (.cse116 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|)) (.cse108 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse112 (select |c_#memory_int| |c_main_~#list~14.base|))) (let ((.cse104 (select .cse112 v_weq1_1)) (.cse110 (select |c_#valid| 0)) (.cse111 (select .cse107 |c_main_~#list~14.offset|)) (.cse102 (select .cse108 v_weq1_1)) (.cse105 (select |c_#valid| |c_main_~#list~14.base|)) (.cse114 (select |c_old(#valid)| 0)) (.cse120 (select .cse116 v_weq1_1)) (.cse113 (select .cse116 |c_main_~#list~14.offset|)) (.cse122 (select .cse112 .cse101)) (.cse118 (select .cse108 |c_main_~#list~14.offset|)) (.cse123 (select |c_old(#valid)| |c_main_~#list~14.base|)) (.cse117 (select |c_old(#valid)| v_weq0_1)) (.cse106 (select .cse112 |c_main_~#list~14.offset|)) (.cse121 (select .cse103 v_weq1_1))) (and (= .cse101 .cse102) (= (select |c_old(#memory_int)| |c_main_~#list~14.base|) (select |c_old(#memory_int)| v_weq0_1)) (= (select .cse103 .cse101) .cse104) (= |c_main_~#list~14.base| v_weq0_1) (= .cse105 (select |c_#valid| v_weq0_1)) (= .cse104 .cse106) (= .cse107 .cse108) (= .cse109 c_main_~dataNotFinished~14) (= .cse110 .cse111) (= |c_#NULL.base| .cse110) (= .cse111 0) (= .cse102 |c_#NULL.base|) (= v_weq1_1 .cse109) (= .cse103 .cse112) (= .cse113 .cse114) (= .cse115 .cse116) (= 1 .cse105) (= (select |c_#length| v_weq0_1) 4) (= .cse117 .cse101) (= .cse114 v_weq1_1) (not (= v_weq0_1 0)) (= .cse118 |c_#NULL.offset|) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (= .cse119 (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|)) (= |c_#NULL.offset| .cse120) (= .cse121 .cse122) (= .cse120 |c_main_~#list~14.offset|) (= 0 .cse113) (= (select .cse115 |c_main_~#list~14.offset|) .cse123) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse122 (select .cse103 |c_main_~#list~14.offset|)) (= c_main_~dataNotFinished~14 .cse118) (= .cse123 .cse117) (= .cse106 .cse121))))) (not (= v_weq1_1 0)) (= (select .cse119 v_weq1_1) .cse109))))) (forall ((v_weq0_1 Int)) (let ((.cse125 (select |c_#valid| v_weq0_1)) (.cse124 (select |c_old(#valid)| v_weq0_1))) (or (= .cse124 .cse125) (let ((.cse129 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse134 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse126 (select |c_#memory_int| |c_main_~#list~14.base|)) (.cse127 (select |c_#valid| 0)) (.cse130 (select .cse134 |c_main_~#list~14.offset|)) (.cse133 (select |c_old(#valid)| 0)) (.cse131 (select |c_#memory_$Pointer$.offset| v_weq0_1)) (.cse128 (select |c_#valid| |c_main_~#list~14.base|)) (.cse132 (select |c_old(#valid)| |c_main_~#list~14.base|)) (.cse135 (select .cse129 |c_main_~#list~14.offset|))) (and (= (select .cse126 |c_main_~#list~14.offset|) (select .cse126 .cse124)) (= |c_#NULL.base| 0) (= (select |c_old(#memory_int)| |c_main_~#list~14.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse124 .cse127) (= |c_main_~#list~14.base| v_weq0_1) (= .cse128 .cse125) (= (select |c_#memory_$Pointer$.base| v_weq0_1) .cse129) (= 0 .cse130) (= (select |c_#memory_int| v_weq0_1) .cse126) (= (select .cse131 |c_main_~#list~14.offset|) .cse132) (= .cse133 c_main_~dataNotFinished~14) (= .cse127 |c_#NULL.base|) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse130 .cse133) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (= .cse131 .cse134) (= 1 .cse128) (= (select |c_#length| v_weq0_1) 4) (= c_main_~dataNotFinished~14 .cse135) (= .cse132 .cse124) (not (= v_weq0_1 0)) (= .cse135 |c_#NULL.offset|) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|)))))))) (= 1 (select |c_#valid| |c_main_~#list~14.base|)) (forall ((v_weq0_1 Int)) (let ((.cse136 (select |c_#length| v_weq0_1))) (or (= .cse136 (select |c_old(#length)| v_weq0_1)) (let ((.cse141 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse146 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse137 (select |c_#memory_int| |c_main_~#list~14.base|)) (.cse139 (select |c_#valid| 0)) (.cse142 (select .cse146 |c_main_~#list~14.offset|)) (.cse145 (select |c_old(#valid)| 0)) (.cse143 (select |c_#memory_$Pointer$.offset| v_weq0_1)) (.cse140 (select |c_#valid| |c_main_~#list~14.base|)) (.cse144 (select |c_old(#valid)| |c_main_~#list~14.base|)) (.cse138 (select |c_old(#valid)| v_weq0_1)) (.cse147 (select .cse141 |c_main_~#list~14.offset|))) (and (= (select .cse137 |c_main_~#list~14.offset|) (select .cse137 .cse138)) (= |c_#NULL.base| 0) (= (select |c_old(#memory_int)| |c_main_~#list~14.base|) (select |c_old(#memory_int)| v_weq0_1)) (= .cse138 .cse139) (= |c_main_~#list~14.base| v_weq0_1) (= .cse140 (select |c_#valid| v_weq0_1)) (= (select |c_#memory_$Pointer$.base| v_weq0_1) .cse141) (= 0 .cse142) (= (select |c_#memory_int| v_weq0_1) .cse137) (= (select .cse143 |c_main_~#list~14.offset|) .cse144) (= .cse145 c_main_~dataNotFinished~14) (= .cse139 |c_#NULL.base|) (not (= 0 v_weq0_1)) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse142 .cse145) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (= .cse143 .cse146) (= 1 .cse140) (= .cse136 4) (= c_main_~dataNotFinished~14 .cse147) (= .cse144 .cse138) (= .cse147 |c_#NULL.offset|) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|)))))))) (forall ((v_weq0_1 Int)) (let ((.cse156 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse148 (select .cse156 v_weq0_1))) (or (let ((.cse155 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|))) (let ((.cse149 (select |c_#valid| 0)) (.cse151 (select .cse155 v_weq0_1)) (.cse152 (select .cse156 |c_main_~#list~14.offset|)) (.cse153 (select |c_old(#valid)| 0)) (.cse154 (select .cse155 |c_main_~#list~14.offset|))) (and (= .cse148 |c_#NULL.base|) (= v_weq0_1 c_main_~dataNotFinished~14) (= .cse149 0) (let ((.cse150 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse150 |c_main_~#list~14.offset|) (select .cse150 v_weq0_1))) (= .cse151 .cse148) (= 0 .cse152) (= |c_#NULL.base| .cse149) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse151) (= .cse153 v_weq0_1) (= .cse152 .cse153) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= c_main_~dataNotFinished~14 .cse154) (= .cse154 |c_#NULL.offset|)))) (not (= v_weq0_1 0)) (= .cse148 (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) v_weq0_1)))))) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)))) (= 0 .cse65) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (not (= |c_#length| |c_old(#valid)|)) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 0)) (= (select (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)))) (forall ((v_weq0_1 Int)) (let ((.cse160 (select |c_#memory_int| |c_main_~#list~14.base|))) (let ((.cse161 (select .cse160 v_weq0_1))) (or (let ((.cse157 (select |c_old(#valid)| 0)) (.cse159 (select (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|) |c_main_~#list~14.offset|)) (.cse158 (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|) |c_main_~#list~14.offset|)) (.cse162 (select |c_old(#valid)| |c_main_~#list~14.base|)) (.cse163 (select |c_#valid| 0))) (and (= .cse157 v_weq0_1) (= .cse158 .cse157) (= v_weq0_1 c_main_~dataNotFinished~14) (not (= 0 |c_main_~#list~14.base|)) (= .cse159 |c_#NULL.base|) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (= (select .cse160 |c_main_~#list~14.offset|) .cse161) (= c_main_~dataNotFinished~14 .cse159) (= .cse162 .cse158) (= |c_#NULL.base| .cse163) (= 0 .cse162) (= .cse163 |c_#NULL.offset|))) (= .cse161 (select (select |c_old(#memory_int)| |c_main_~#list~14.base|) v_weq0_1)))))) (not (= 0 |c_main_~#list~14.base|)) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse165 (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (.cse164 (select |c_#memory_$Pointer$.base| v_weq0_1))) (or (= (select .cse164 v_weq1_1) (select .cse165 v_weq1_1)) (let ((.cse180 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse168 (select .cse180 v_weq1_1)) (.cse181 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|)) (.cse173 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse167 (select |c_#memory_int| v_weq0_1)) (.cse182 (select |c_old(#valid)| v_weq0_1)) (.cse176 (select |c_#memory_int| |c_main_~#list~14.base|))) (let ((.cse170 (select .cse176 v_weq1_1)) (.cse166 (select .cse167 .cse182)) (.cse169 (select .cse173 v_weq1_1)) (.cse179 (select |c_old(#valid)| 0)) (.cse184 (select .cse180 |c_main_~#list~14.offset|)) (.cse175 (select |c_#valid| 0)) (.cse185 (select .cse181 v_weq1_1)) (.cse177 (select |c_#valid| v_weq0_1)) (.cse174 (select .cse176 .cse182)) (.cse171 (select .cse176 |c_main_~#list~14.offset|)) (.cse186 (select .cse176 .cse168)) (.cse183 (select .cse173 |c_main_~#list~14.offset|)) (.cse172 (select .cse164 |c_main_~#list~14.offset|)) (.cse178 (select .cse181 |c_main_~#list~14.offset|))) (and (= .cse166 (select .cse167 |c_main_~#list~14.offset|)) (= .cse168 .cse169) (= (select |c_old(#memory_int)| |c_main_~#list~14.base|) (select |c_old(#memory_int)| v_weq0_1)) (= (select .cse167 .cse168) .cse170) (= |c_main_~#list~14.base| v_weq0_1) (= .cse170 .cse171) (= 0 .cse172) (= .cse164 .cse173) (= .cse174 .cse166) (= |c_#NULL.base| .cse175) (= .cse169 |c_#NULL.base|) (= .cse167 .cse176) (= v_weq1_1 c_main_~dataNotFinished~14) (not (= 0 v_weq0_1)) (= .cse177 (select |c_#valid| |c_main_~#list~14.base|)) (= .cse178 .cse179) (= .cse180 .cse181) (= (select |c_#length| v_weq0_1) 4) (= .cse182 .cse168) (= .cse179 v_weq1_1) (= .cse183 |c_#NULL.offset|) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|)) (= .cse184 .cse182) (= |c_#NULL.offset| .cse185) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse184) (= .cse175 0) (= .cse185 |c_main_~#list~14.offset|) (= 1 .cse177) (= .cse186 .cse174) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) .cse165) (= .cse171 .cse186) (= c_main_~dataNotFinished~14 .cse183) (= .cse172 .cse178)))))))) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|) v_weq0_1) (select (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|) v_weq0_1)))) (= .cse187 .cse67) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (not (= v_weq0_1 |c_main_~#list~14.base|)) (not (= v_weq1_1 0)) (= (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 (let ((.cse195 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse196 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse188 (select .cse196 v_weq0_1)) (.cse189 (select |c_#valid| 0)) (.cse191 (select .cse195 v_weq0_1)) (.cse192 (select .cse196 |c_main_~#list~14.offset|)) (.cse193 (select |c_old(#valid)| 0)) (.cse194 (select .cse195 |c_main_~#list~14.offset|))) (and (= .cse188 |c_#NULL.base|) (= .cse189 0) (let ((.cse190 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse190 |c_main_~#list~14.offset|) (select .cse190 v_weq0_1))) (= .cse191 .cse188) (= 0 .cse192) (= c_main_~dataNotFinished~14 v_weq0_1) (= |c_#NULL.base| .cse189) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse191) (= .cse193 c_main_~dataNotFinished~14) (= v_weq0_1 .cse194) (= .cse192 .cse193) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse194 |c_#NULL.offset|)))) (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)) (not (= v_weq0_1 0)))) (forall ((v_weq0_1 Int)) (let ((.cse205 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse197 (select .cse205 v_weq0_1))) (or (let ((.cse204 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|))) (let ((.cse198 (select |c_#valid| 0)) (.cse200 (select .cse204 v_weq0_1)) (.cse201 (select .cse205 |c_main_~#list~14.offset|)) (.cse202 (select |c_old(#valid)| 0)) (.cse203 (select .cse204 |c_main_~#list~14.offset|))) (and (= .cse197 |c_#NULL.base|) (= .cse198 0) (let ((.cse199 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse199 |c_main_~#list~14.offset|) (select .cse199 v_weq0_1))) (= .cse200 .cse197) (= 0 .cse201) (= c_main_~dataNotFinished~14 v_weq0_1) (= |c_#NULL.base| .cse198) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse200) (= .cse202 c_main_~dataNotFinished~14) (= v_weq0_1 .cse203) (= .cse201 .cse202) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse203 |c_#NULL.offset|)))) (= .cse197 (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|) v_weq0_1)))))) (forall ((v_weq0_1 Int)) (or (let ((.cse213 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse214 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse206 (select .cse214 v_weq0_1)) (.cse207 (select |c_#valid| 0)) (.cse209 (select .cse213 v_weq0_1)) (.cse210 (select .cse214 |c_main_~#list~14.offset|)) (.cse211 (select |c_old(#valid)| 0)) (.cse212 (select .cse213 |c_main_~#list~14.offset|))) (and (= .cse206 |c_#NULL.base|) (= .cse207 0) (let ((.cse208 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse208 |c_main_~#list~14.offset|) (select .cse208 v_weq0_1))) (= .cse209 .cse206) (= 0 .cse210) (= c_main_~dataNotFinished~14 v_weq0_1) (= |c_#NULL.base| .cse207) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse209) (= .cse211 c_main_~dataNotFinished~14) (= v_weq0_1 .cse212) (= .cse210 .cse211) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse212 |c_#NULL.offset|)))) (not (= v_weq0_1 0)) (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) v_weq0_1) (select (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|) v_weq0_1)))) (= c_main_~dataNotFinished~14 .cse187) (forall ((v_weq0_1 Int)) (or (let ((.cse222 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse223 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse215 (select .cse223 v_weq0_1)) (.cse216 (select |c_#valid| 0)) (.cse218 (select .cse222 v_weq0_1)) (.cse219 (select .cse223 |c_main_~#list~14.offset|)) (.cse220 (select |c_old(#valid)| 0)) (.cse221 (select .cse222 |c_main_~#list~14.offset|))) (and (= .cse215 |c_#NULL.base|) (= .cse216 0) (let ((.cse217 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse217 |c_main_~#list~14.offset|) (select .cse217 v_weq0_1))) (= .cse218 .cse215) (= 0 .cse219) (= c_main_~dataNotFinished~14 v_weq0_1) (= |c_#NULL.base| .cse216) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse218) (= .cse220 c_main_~dataNotFinished~14) (= v_weq0_1 .cse221) (= .cse219 .cse220) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (not (= |c_main_~#list~14.base| 0)) (= .cse221 |c_#NULL.offset|)))) (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)))) (forall ((v_weq0_1 Int)) (let ((.cse231 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|))) (let ((.cse227 (select .cse231 v_weq0_1))) (or (let ((.cse232 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|))) (let ((.cse224 (select .cse232 v_weq0_1)) (.cse225 (select |c_#valid| 0)) (.cse228 (select .cse232 |c_main_~#list~14.offset|)) (.cse229 (select |c_old(#valid)| 0)) (.cse230 (select .cse231 |c_main_~#list~14.offset|))) (and (= .cse224 |c_#NULL.base|) (= v_weq0_1 c_main_~dataNotFinished~14) (not (= 0 |c_main_~#list~14.base|)) (= .cse225 0) (let ((.cse226 (select |c_#memory_int| |c_main_~#list~14.base|))) (= (select .cse226 |c_main_~#list~14.offset|) (select .cse226 v_weq0_1))) (= .cse227 .cse224) (= 0 .cse228) (= |c_#NULL.base| .cse225) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse227) (= .cse229 v_weq0_1) (= .cse228 .cse229) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (= c_main_~dataNotFinished~14 .cse230) (= .cse230 |c_#NULL.offset|)))) (= (select (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) v_weq0_1) .cse227))))) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse234 (select |c_#memory_int| v_weq0_1))) (let ((.cse252 (select .cse234 v_weq1_1)) (.cse233 (select |c_old(#memory_int)| v_weq0_1))) (or (let ((.cse248 (select |c_#memory_$Pointer$.offset| v_weq0_1))) (let ((.cse249 (select |c_#memory_$Pointer$.offset| |c_main_~#list~14.base|)) (.cse235 (select .cse248 v_weq1_1)) (.cse240 (select |c_#memory_$Pointer$.base| |c_main_~#list~14.base|)) (.cse239 (select |c_#memory_$Pointer$.base| v_weq0_1)) (.cse243 (select |c_#memory_int| |c_main_~#list~14.base|))) (let ((.cse236 (select .cse243 v_weq1_1)) (.cse241 (select .cse239 v_weq1_1)) (.cse247 (select |c_old(#valid)| 0)) (.cse244 (select .cse240 |c_main_~#list~14.offset|)) (.cse250 (select |c_old(#valid)| v_weq0_1)) (.cse251 (select .cse248 |c_main_~#list~14.offset|)) (.cse242 (select |c_#valid| 0)) (.cse245 (select |c_#valid| v_weq0_1)) (.cse253 (select .cse243 .cse235)) (.cse237 (select .cse243 |c_main_~#list~14.offset|)) (.cse238 (select .cse239 |c_main_~#list~14.offset|)) (.cse246 (select .cse249 |c_main_~#list~14.offset|))) (and (= (select |c_old(#memory_int)| |c_main_~#list~14.base|) .cse233) (= (select .cse234 .cse235) .cse236) (= |c_main_~#list~14.base| v_weq0_1) (= .cse236 .cse237) (= 0 .cse238) (= .cse239 .cse240) (= c_main_~dataNotFinished~14 .cse241) (= |c_#NULL.base| .cse242) (= .cse234 .cse243) (= v_weq1_1 c_main_~dataNotFinished~14) (= .cse241 .cse244) (not (= 0 v_weq0_1)) (= .cse245 (select |c_#valid| |c_main_~#list~14.base|)) (= .cse246 .cse247) (= |c_#NULL.offset| |c_main_~#list~14.offset|) (= .cse248 .cse249) (= (select |c_#length| v_weq0_1) 4) (= .cse250 .cse235) (= .cse247 v_weq1_1) (= .cse244 |c_#NULL.offset|) (= 4 (select |c_#length| |c_main_~#list~14.base|)) (= (select |c_old(#memory_$Pointer$.offset)| v_weq0_1) (select |c_old(#memory_$Pointer$.offset)| |c_main_~#list~14.base|)) (= .cse251 .cse250) (= .cse252 .cse253) (= (select |c_old(#valid)| |c_main_~#list~14.base|) .cse251) (= .cse242 0) (= 1 .cse245) (= .cse235 |c_#NULL.base|) (= (select |c_old(#memory_$Pointer$.base)| |c_main_~#list~14.base|) (select |c_old(#memory_$Pointer$.base)| v_weq0_1)) (= .cse253 (select .cse234 |c_main_~#list~14.offset|)) (= .cse237 .cse252) (= .cse238 .cse246))))) (= .cse252 (select .cse233 v_weq1_1)))))) (not (= |c_#valid| |c_old(#valid)|)))) is different from false [2018-01-24 15:40:35,254 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_$Pointer$.offset| c_append_~pointerToList.base)) (.cse23 (select |c_#memory_$Pointer$.base| c_append_~pointerToList.base)) (.cse22 (select |c_#memory_$Pointer$.base| |c_append_#in~pointerToList.base|))) (let ((.cse0 (select |c_#valid| |c_append_#in~pointerToList.base|)) (.cse4 (select .cse22 |c_#NULL.offset|)) (.cse3 (select .cse23 c_append_~pointerToList.offset)) (.cse6 (select |c_#valid| 0)) (.cse20 (select |c_old(#valid)| 0)) (.cse7 (select |c_old(#valid)| |c_append_#t~malloc34.base|)) (.cse1 (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~pointerToList.base|)) (.cse2 (select |c_old(#valid)| |c_append_#in~pointerToList.base|)) (.cse5 (select .cse21 c_append_~pointerToList.offset))) (and (= 1 .cse0) (= (select .cse1 |c_#NULL.offset|) |c_append_#t~mem36.base|) (= .cse0 .cse2) (= 0 .cse3) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 0)) (= (select (select |c_#memory_$Pointer$.base| |c_append_#in~pointerToList.base|) v_weq0_1) (select |c_#valid| v_weq0_1)))) (= 4 (select |c_old(#length)| |c_append_#in~pointerToList.base|)) (= .cse4 |c_append_#in~pointerToList.offset|) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.offset| |c_append_#in~pointerToList.base|) v_weq0_1) (select (select |c_#memory_$Pointer$.base| |c_append_#in~pointerToList.base|) v_weq0_1)) (not (= v_weq0_1 0)))) (not (= |c_old(#length)| |c_old(#valid)|)) (= c_append_~node~11.offset .cse5) (= c_append_~pointerToList.offset .cse4) (= .cse6 |c_#NULL.base|) (= |c_append_#in~pointerToList.base| c_append_~pointerToList.base) (= .cse7 0) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (or (not (= v_weq1_1 0)) (not (= v_weq0_1 |c_append_#in~pointerToList.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)))) (not (= |c_#valid| |c_#length|)) (= (select |c_#length| |c_append_#t~malloc34.base|) 8) (= (select |c_#valid| c_append_~pointerToList.base) 1) (forall ((v_weq0_1 Int)) (let ((.cse8 (select |c_#length| v_weq0_1))) (or (= .cse8 (select |c_old(#length)| v_weq0_1)) (let ((.cse9 (select |c_#valid| |c_append_#in~pointerToList.base|)) (.cse13 (select (select |c_#memory_$Pointer$.base| |c_append_#in~pointerToList.base|) |c_#NULL.offset|)) (.cse12 (select |c_old(#valid)| v_weq0_1)) (.cse11 (select (select |c_#memory_$Pointer$.base| c_append_~pointerToList.base) c_append_~pointerToList.offset)) (.cse15 (select |c_#valid| 0)) (.cse18 (select |c_old(#valid)| 0)) (.cse16 (select |c_old(#valid)| |c_append_#t~malloc34.base|)) (.cse14 (select (select |c_#memory_$Pointer$.offset| c_append_~pointerToList.base) c_append_~pointerToList.offset)) (.cse10 (select |c_old(#valid)| |c_append_#in~pointerToList.base|)) (.cse19 (select |c_#valid| v_weq0_1)) (.cse17 (select |c_#length| |c_append_#t~malloc34.base|))) (and (not (= 0 |c_append_#t~malloc34.base|)) (= 1 .cse9) (not (= |c_append_#in~pointerToList.base| |c_append_#t~malloc34.base|)) (= (select (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~pointerToList.base|) |c_#NULL.offset|) |c_append_#t~mem36.base|) (= .cse9 .cse10) (= 0 .cse11) (= .cse12 |c_append_#t~malloc34.offset|) (= v_weq0_1 |c_append_#t~malloc34.base|) (= .cse13 |c_append_#in~pointerToList.offset|) (= c_append_~node~11.offset .cse14) (= c_append_~pointerToList.offset .cse13) (= .cse15 |c_#NULL.base|) (= |c_append_#in~pointerToList.offset| .cse12) (= .cse16 0) (= .cse17 8) (= (select |c_#valid| c_append_~pointerToList.base) 1) (not (= 0 |c_append_#in~pointerToList.base|)) (= .cse11 .cse18) (= |c_append_#t~malloc34.offset| .cse15) (= .cse19 (select |c_#valid| |c_append_#t~malloc34.base|)) (= .cse18 |c_#NULL.offset|) (= |c_append_#t~mem36.base| c_append_~pointerToList.offset) (= |c_#NULL.base| .cse16) (= c_append_~node~11.base v_weq0_1) (= .cse14 |c_append_#t~mem36.offset|) (= |c_#NULL.offset| c_append_~node~11.offset) (= .cse10 .cse19) (= .cse8 .cse17)))))) (not (= 0 |c_append_#in~pointerToList.base|)) (= .cse3 .cse20) (not (= 0 c_append_~node~11.base)) (= (select |c_#memory_int| |c_append_#in~pointerToList.base|) (select |c_old(#memory_int)| |c_append_#in~pointerToList.base|)) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_append_#t~malloc34.offset| .cse6) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (not (= |c_#length| |c_old(#valid)|)) (not (= c_append_~node~11.base |c_append_#in~pointerToList.base|)) (forall ((v_weq0_1 Int)) (or (= (select (select |c_#memory_$Pointer$.offset| |c_append_#in~pointerToList.base|) v_weq0_1) (select |c_#valid| v_weq0_1)) (not (= v_weq0_1 0)))) (= |c_append_#in~pointerToList.offset| |c_append_#t~malloc34.offset|) (= .cse20 |c_#NULL.offset|) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 0)) (= (select (select |c_#memory_$Pointer$.base| |c_append_#in~pointerToList.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)))) (= |c_append_#t~mem36.base| c_append_~pointerToList.offset) (= |c_#NULL.base| .cse7) (= .cse1 .cse21) (= c_append_~node~11.base |c_append_#t~malloc34.base|) (= .cse21 (select |c_#memory_$Pointer$.offset| |c_append_#in~pointerToList.base|)) (= .cse2 (select |c_#valid| |c_append_#t~malloc34.base|)) (= .cse22 .cse23) (= .cse5 |c_append_#t~mem36.offset|) (= .cse23 (select |c_old(#memory_$Pointer$.base)| |c_append_#in~pointerToList.base|)) (= |c_#NULL.offset| c_append_~node~11.offset) (= |c_#memory_int| |c_old(#memory_int)|) (forall ((v_weq0_1 Int)) (let ((.cse25 (select |c_old(#valid)| v_weq0_1)) (.cse34 (select |c_#valid| v_weq0_1))) (or (let ((.cse24 (select |c_#valid| |c_append_#in~pointerToList.base|)) (.cse29 (select (select |c_#memory_$Pointer$.base| |c_append_#in~pointerToList.base|) |c_#NULL.offset|)) (.cse26 (select |c_#valid| 0)) (.cse28 (select (select |c_#memory_$Pointer$.base| c_append_~pointerToList.base) c_append_~pointerToList.offset)) (.cse33 (select |c_old(#valid)| 0)) (.cse31 (select |c_old(#valid)| |c_append_#t~malloc34.base|)) (.cse30 (select (select |c_#memory_$Pointer$.offset| c_append_~pointerToList.base) c_append_~pointerToList.offset)) (.cse27 (select |c_old(#valid)| |c_append_#in~pointerToList.base|)) (.cse32 (select |c_#length| |c_append_#t~malloc34.base|))) (and (= 1 .cse24) (= .cse25 .cse26) (= (select (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~pointerToList.base|) |c_#NULL.offset|) |c_append_#t~mem36.base|) (= .cse24 .cse27) (= |c_append_#t~malloc34.offset| .cse25) (= 0 .cse28) (= v_weq0_1 |c_append_#t~malloc34.base|) (= .cse29 |c_append_#in~pointerToList.offset|) (= c_append_~node~11.offset .cse30) (not (= |c_append_#t~malloc34.base| 0)) (= c_append_~pointerToList.offset .cse29) (= .cse26 |c_#NULL.base|) (= .cse31 0) (= .cse32 8) (= (select |c_#valid| c_append_~pointerToList.base) 1) (not (= |c_append_#t~malloc34.base| |c_append_#in~pointerToList.base|)) (not (= 0 |c_append_#in~pointerToList.base|)) (= .cse28 .cse33) (= .cse34 (select |c_#valid| |c_append_#t~malloc34.base|)) (= |c_append_#in~pointerToList.offset| |c_append_#t~malloc34.offset|) (= .cse33 |c_#NULL.offset|) (= |c_append_#t~mem36.base| c_append_~pointerToList.offset) (= |c_#NULL.base| .cse31) (= c_append_~node~11.base v_weq0_1) (= .cse30 |c_append_#t~mem36.offset|) (= |c_#NULL.offset| c_append_~node~11.offset) (= .cse27 .cse34) (= (select |c_#length| v_weq0_1) .cse32))) (= .cse25 .cse34)))) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_append_#in~pointerToList.base|) v_weq0_1) (select |c_old(#valid)| v_weq0_1)))) (not (= |c_#valid| |c_old(#length)|)) (not (= |c_#valid| |c_old(#valid)|))))) is different from false [2018-01-24 15:40:36,097 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 15:40:36,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:40:36,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [8] total 31 [2018-01-24 15:40:36,098 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:40:36,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 15:40:36,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 15:40:36,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=388, Unknown=3, NotChecked=126, Total=600 [2018-01-24 15:40:36,100 INFO L87 Difference]: Start difference. First operand 238 states and 261 transitions. Second operand 25 states. Received shutdown request... [2018-01-24 15:40:52,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 15:40:52,547 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:40:52,554 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:40:52,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:40:52 BoogieIcfgContainer [2018-01-24 15:40:52,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:40:52,555 INFO L168 Benchmark]: Toolchain (without parser) took 47304.87 ms. Allocated memory was 303.6 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 263.3 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 177.3 MB. Max. memory is 5.3 GB. [2018-01-24 15:40:52,555 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 303.6 MB. Free memory is still 269.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:40:52,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.92 ms. Allocated memory is still 303.6 MB. Free memory was 262.3 MB in the beginning and 251.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:40:52,556 INFO L168 Benchmark]: Boogie Preprocessor took 46.58 ms. Allocated memory is still 303.6 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:40:52,556 INFO L168 Benchmark]: RCFGBuilder took 777.10 ms. Allocated memory is still 303.6 MB. Free memory was 248.3 MB in the beginning and 198.8 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 5.3 GB. [2018-01-24 15:40:52,556 INFO L168 Benchmark]: TraceAbstraction took 46231.28 ms. Allocated memory was 303.6 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 198.8 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 112.8 MB. Max. memory is 5.3 GB. [2018-01-24 15:40:52,558 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.21 ms. Allocated memory is still 303.6 MB. Free memory is still 269.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 241.92 ms. Allocated memory is still 303.6 MB. Free memory was 262.3 MB in the beginning and 251.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.58 ms. Allocated memory is still 303.6 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 777.10 ms. Allocated memory is still 303.6 MB. Free memory was 248.3 MB in the beginning and 198.8 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 46231.28 ms. Allocated memory was 303.6 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 198.8 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 112.8 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 : 607 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) : 77.666224 RENAME_VARIABLES(MILLISECONDS) : 23.861375 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 77.603367 PROJECTAWAY(MILLISECONDS) : 37.181646 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.040854 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 23.934398 ADD_EQUALITY(MILLISECONDS) : 0.083712 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.065976 #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 (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 585]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 585). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (238states) and interpolant automaton (currently 13 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 27 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 213 locations, 91 error locations. TIMEOUT Result, 46.1s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 20.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2163 SDtfs, 932 SDslu, 3592 SDs, 0 SdLazy, 3297 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 118 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 84 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 11.9s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9352081560622413 AbsIntWeakeningRatio, 1.0526315789473684 AbsIntAvgWeakeningVarsNumRemoved, 22.57894736842105 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 119 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, 28785 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_test01_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-40-52-569.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test01_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-40-52-569.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test01_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-40-52-569.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test01_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-40-52-569.csv Completed graceful shutdown