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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:41:39,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:41:39,911 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:41:39,922 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:41:39,922 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:41:39,923 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:41:39,924 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:41:39,926 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:41:39,927 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:41:39,928 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:41:39,929 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:41:39,929 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:41:39,930 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:41:39,931 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:41:39,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:41:39,934 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:41:39,935 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:41:39,937 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:41:39,938 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:41:39,939 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:41:39,941 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:41:39,941 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:41:39,941 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:41:39,942 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:41:39,942 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:41:39,943 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:41:39,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:41:39,944 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:41:39,944 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:41:39,944 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:41:39,945 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:41:39,945 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:41:39,955 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:41:39,955 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:41:39,956 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:41:39,956 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:41:39,956 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:41:39,957 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:41:39,957 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:41:39,957 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:41:39,957 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:41:39,957 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:41:39,957 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:41:39,957 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:41:39,958 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:41:39,958 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:41:39,958 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:41:39,958 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:41:39,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:41:39,958 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:41:39,958 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:41:39,959 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:41:39,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:41:39,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:41:39,959 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:41:39,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:41:39,998 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:41:40,001 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:41:40,003 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:41:40,003 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:41:40,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:41:40,140 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:41:40,142 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:41:40,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:41:40,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:41:40,148 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:41:40,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:41:40" (1/1) ... [2018-02-02 20:41:40,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@caa7032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:40, skipping insertion in model container [2018-02-02 20:41:40,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:41:40" (1/1) ... [2018-02-02 20:41:40,163 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:41:40,196 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:41:40,284 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:41:40,305 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:41:40,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:40 WrapperNode [2018-02-02 20:41:40,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:41:40,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:41:40,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:41:40,316 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:41:40,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:40" (1/1) ... [2018-02-02 20:41:40,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:40" (1/1) ... [2018-02-02 20:41:40,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:40" (1/1) ... [2018-02-02 20:41:40,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:40" (1/1) ... [2018-02-02 20:41:40,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:40" (1/1) ... [2018-02-02 20:41:40,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:40" (1/1) ... [2018-02-02 20:41:40,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:40" (1/1) ... [2018-02-02 20:41:40,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:41:40,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:41:40,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:41:40,360 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:41:40,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:40" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 20:41:40,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:41:40,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:41:40,410 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-02-02 20:41:40,410 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-02-02 20:41:40,410 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-02-02 20:41:40,411 INFO L136 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-02-02 20:41:40,411 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-02-02 20:41:40,411 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-02-02 20:41:40,411 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:41:40,411 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:41:40,411 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:41:40,411 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:41:40,411 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:41:40,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:41:40,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:41:40,412 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:41:40,412 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 20:41:40,412 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:41:40,412 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 20:41:40,412 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:41:40,412 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-02-02 20:41:40,412 INFO L128 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-02-02 20:41:40,413 INFO L128 BoogieDeclarations]: Found specification of procedure merge_pair [2018-02-02 20:41:40,413 INFO L128 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-02-02 20:41:40,413 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_before [2018-02-02 20:41:40,413 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_after [2018-02-02 20:41:40,413 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:41:40,413 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:41:40,413 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:41:40,941 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:41:40,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:41:40 BoogieIcfgContainer [2018-02-02 20:41:40,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:41:40,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:41:40,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:41:40,946 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:41:40,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:41:40" (1/3) ... [2018-02-02 20:41:40,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be98212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:41:40, skipping insertion in model container [2018-02-02 20:41:40,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:40" (2/3) ... [2018-02-02 20:41:40,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be98212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:41:40, skipping insertion in model container [2018-02-02 20:41:40,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:41:40" (3/3) ... [2018-02-02 20:41:40,949 INFO L107 eAbstractionObserver]: Analyzing ICFG merge_sort_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:41:40,956 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:41:40,962 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 109 error locations. [2018-02-02 20:41:40,997 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:41:40,997 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:41:40,997 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:41:40,997 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:41:40,998 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:41:40,998 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:41:40,998 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:41:40,998 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:41:40,999 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:41:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states. [2018-02-02 20:41:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-02 20:41:41,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:41,026 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:41,026 INFO L371 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:41,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1556477250, now seen corresponding path program 1 times [2018-02-02 20:41:41,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:41,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:41,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-02-02 20:41:41,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:41,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:41:41,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,155 INFO L182 omatonBuilderFactory]: Interpolants [318#true, 319#false] [2018-02-02 20:41:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 20:41:41,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 20:41:41,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:41:41,255 INFO L87 Difference]: Start difference. First operand 315 states. Second operand 2 states. [2018-02-02 20:41:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:41,295 INFO L93 Difference]: Finished difference Result 313 states and 338 transitions. [2018-02-02 20:41:41,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 20:41:41,296 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-02 20:41:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:41,304 INFO L225 Difference]: With dead ends: 313 [2018-02-02 20:41:41,305 INFO L226 Difference]: Without dead ends: 296 [2018-02-02 20:41:41,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:41:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-02-02 20:41:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-02-02 20:41:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-02 20:41:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 309 transitions. [2018-02-02 20:41:41,342 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 309 transitions. Word has length 9 [2018-02-02 20:41:41,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:41,342 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 309 transitions. [2018-02-02 20:41:41,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 20:41:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 309 transitions. [2018-02-02 20:41:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 20:41:41,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:41,343 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:41,343 INFO L371 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:41,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1087749341, now seen corresponding path program 1 times [2018-02-02 20:41:41,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:41,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:41,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:41:41,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,397 INFO L182 omatonBuilderFactory]: Interpolants [929#true, 930#false, 931#(= |#valid| |old(#valid)|)] [2018-02-02 20:41:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:41:41,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:41:41,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:41:41,398 INFO L87 Difference]: Start difference. First operand 296 states and 309 transitions. Second operand 3 states. [2018-02-02 20:41:41,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:41,681 INFO L93 Difference]: Finished difference Result 339 states and 361 transitions. [2018-02-02 20:41:41,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:41:41,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 20:41:41,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:41,683 INFO L225 Difference]: With dead ends: 339 [2018-02-02 20:41:41,683 INFO L226 Difference]: Without dead ends: 338 [2018-02-02 20:41:41,684 INFO L554 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-02-02 20:41:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-02 20:41:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 300. [2018-02-02 20:41:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-02 20:41:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 314 transitions. [2018-02-02 20:41:41,696 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 314 transitions. Word has length 11 [2018-02-02 20:41:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:41,697 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 314 transitions. [2018-02-02 20:41:41,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:41:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 314 transitions. [2018-02-02 20:41:41,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:41:41,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:41,697 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:41,698 INFO L371 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:41,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1650764336, now seen corresponding path program 1 times [2018-02-02 20:41:41,699 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:41,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:41,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:41:41,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,776 INFO L182 omatonBuilderFactory]: Interpolants [1571#true, 1572#false, 1573#(and (= 8 (select |#length| |main_#t~malloc41.base|)) (= 0 |main_#t~malloc41.offset|)), 1574#(and (= (select |#length| main_~node~1.base) 8) (= main_~node~1.offset 0))] [2018-02-02 20:41:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:41:41,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:41:41,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:41:41,778 INFO L87 Difference]: Start difference. First operand 300 states and 314 transitions. Second operand 4 states. [2018-02-02 20:41:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:41,992 INFO L93 Difference]: Finished difference Result 328 states and 346 transitions. [2018-02-02 20:41:41,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:41:41,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 20:41:41,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:41,993 INFO L225 Difference]: With dead ends: 328 [2018-02-02 20:41:41,993 INFO L226 Difference]: Without dead ends: 328 [2018-02-02 20:41:41,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-02 20:41:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-02 20:41:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 298. [2018-02-02 20:41:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-02 20:41:42,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 312 transitions. [2018-02-02 20:41:42,004 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 312 transitions. Word has length 13 [2018-02-02 20:41:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:42,004 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 312 transitions. [2018-02-02 20:41:42,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:41:42,005 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 312 transitions. [2018-02-02 20:41:42,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:41:42,005 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:42,005 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:42,005 INFO L371 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:42,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1650764335, now seen corresponding path program 1 times [2018-02-02 20:41:42,006 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:42,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:42,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:41:42,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,034 INFO L182 omatonBuilderFactory]: Interpolants [2204#true, 2205#false, 2206#(= 1 (select |#valid| |main_#t~malloc41.base|)), 2207#(= 1 (select |#valid| main_~node~1.base))] [2018-02-02 20:41:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:41:42,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:41:42,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:41:42,035 INFO L87 Difference]: Start difference. First operand 298 states and 312 transitions. Second operand 4 states. [2018-02-02 20:41:42,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:42,258 INFO L93 Difference]: Finished difference Result 315 states and 332 transitions. [2018-02-02 20:41:42,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:41:42,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 20:41:42,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:42,259 INFO L225 Difference]: With dead ends: 315 [2018-02-02 20:41:42,259 INFO L226 Difference]: Without dead ends: 315 [2018-02-02 20:41:42,259 INFO L554 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-02-02 20:41:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-02 20:41:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 296. [2018-02-02 20:41:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-02 20:41:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 310 transitions. [2018-02-02 20:41:42,266 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 310 transitions. Word has length 13 [2018-02-02 20:41:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:42,266 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 310 transitions. [2018-02-02 20:41:42,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:41:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 310 transitions. [2018-02-02 20:41:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:41:42,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:42,267 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:42,267 INFO L371 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:42,268 INFO L82 PathProgramCache]: Analyzing trace with hash 45229303, now seen corresponding path program 1 times [2018-02-02 20:41:42,268 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:42,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:42,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:41:42,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,293 INFO L182 omatonBuilderFactory]: Interpolants [2822#true, 2823#false, 2824#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))] [2018-02-02 20:41:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:41:42,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:41:42,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:41:42,294 INFO L87 Difference]: Start difference. First operand 296 states and 310 transitions. Second operand 3 states. [2018-02-02 20:41:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:42,312 INFO L93 Difference]: Finished difference Result 315 states and 327 transitions. [2018-02-02 20:41:42,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:41:42,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 20:41:42,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:42,314 INFO L225 Difference]: With dead ends: 315 [2018-02-02 20:41:42,314 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 20:41:42,314 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:41:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 20:41:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 295. [2018-02-02 20:41:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-02 20:41:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 308 transitions. [2018-02-02 20:41:42,321 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 308 transitions. Word has length 17 [2018-02-02 20:41:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:42,321 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 308 transitions. [2018-02-02 20:41:42,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:41:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 308 transitions. [2018-02-02 20:41:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 20:41:42,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:42,322 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:42,322 INFO L371 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash 963226955, now seen corresponding path program 1 times [2018-02-02 20:41:42,323 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:42,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:42,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:41:42,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,394 INFO L182 omatonBuilderFactory]: Interpolants [3435#true, 3436#false, 3437#(and (= 0 |main_#t~malloc45.offset|) (= 8 (select |#length| |main_#t~malloc45.base|))), 3438#(and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0))] [2018-02-02 20:41:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:41:42,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:41:42,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:41:42,395 INFO L87 Difference]: Start difference. First operand 295 states and 308 transitions. Second operand 4 states. [2018-02-02 20:41:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:42,539 INFO L93 Difference]: Finished difference Result 329 states and 345 transitions. [2018-02-02 20:41:42,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:41:42,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 20:41:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:42,541 INFO L225 Difference]: With dead ends: 329 [2018-02-02 20:41:42,541 INFO L226 Difference]: Without dead ends: 329 [2018-02-02 20:41:42,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-02 20:41:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-02 20:41:42,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 293. [2018-02-02 20:41:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-02 20:41:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 306 transitions. [2018-02-02 20:41:42,545 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 306 transitions. Word has length 20 [2018-02-02 20:41:42,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:42,546 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 306 transitions. [2018-02-02 20:41:42,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:41:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 306 transitions. [2018-02-02 20:41:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 20:41:42,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:42,546 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:42,546 INFO L371 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:42,547 INFO L82 PathProgramCache]: Analyzing trace with hash 963226954, now seen corresponding path program 1 times [2018-02-02 20:41:42,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:42,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:42,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:41:42,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,577 INFO L182 omatonBuilderFactory]: Interpolants [4064#true, 4065#false, 4066#(= 1 (select |#valid| |main_#t~malloc45.base|)), 4067#(= 1 (select |#valid| main_~item~0.base))] [2018-02-02 20:41:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:41:42,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:41:42,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:41:42,577 INFO L87 Difference]: Start difference. First operand 293 states and 306 transitions. Second operand 4 states. [2018-02-02 20:41:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:42,711 INFO L93 Difference]: Finished difference Result 316 states and 331 transitions. [2018-02-02 20:41:42,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:41:42,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 20:41:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:42,713 INFO L225 Difference]: With dead ends: 316 [2018-02-02 20:41:42,713 INFO L226 Difference]: Without dead ends: 316 [2018-02-02 20:41:42,713 INFO L554 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-02-02 20:41:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-02 20:41:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 291. [2018-02-02 20:41:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 20:41:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 304 transitions. [2018-02-02 20:41:42,717 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 304 transitions. Word has length 20 [2018-02-02 20:41:42,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:42,717 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 304 transitions. [2018-02-02 20:41:42,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:41:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 304 transitions. [2018-02-02 20:41:42,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:41:42,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:42,718 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:41:42,718 INFO L371 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:42,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1725402921, now seen corresponding path program 1 times [2018-02-02 20:41:42,719 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:42,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:42,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:41:42,759 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,759 INFO L182 omatonBuilderFactory]: Interpolants [4678#true, 4679#false, 4680#(not (= 0 |main_#t~malloc45.base|)), 4681#(not (= 0 main_~item~0.base)), 4682#(not (= 0 main_~data~0.base))] [2018-02-02 20:41:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:41:42,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:41:42,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:41:42,760 INFO L87 Difference]: Start difference. First operand 291 states and 304 transitions. Second operand 5 states. [2018-02-02 20:41:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:42,822 INFO L93 Difference]: Finished difference Result 331 states and 347 transitions. [2018-02-02 20:41:42,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:41:42,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-02-02 20:41:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:42,824 INFO L225 Difference]: With dead ends: 331 [2018-02-02 20:41:42,825 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 20:41:42,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:41:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 20:41:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2018-02-02 20:41:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 20:41:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 303 transitions. [2018-02-02 20:41:42,831 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 303 transitions. Word has length 27 [2018-02-02 20:41:42,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:42,832 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 303 transitions. [2018-02-02 20:41:42,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:41:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 303 transitions. [2018-02-02 20:41:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:41:42,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:42,833 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:41:42,835 INFO L371 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:42,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1961365059, now seen corresponding path program 1 times [2018-02-02 20:41:42,836 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:42,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:42,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:41:42,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,880 INFO L182 omatonBuilderFactory]: Interpolants [5312#(= 1 (select |#valid| main_~item~0.base)), 5313#(= 1 (select |#valid| main_~data~0.base)), 5314#(= 1 (select |#valid| |inspect_before_#in~shape.base|)), 5315#(= 1 (select |#valid| inspect_before_~shape.base)), 5310#true, 5311#false] [2018-02-02 20:41:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:41:42,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:41:42,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:41:42,881 INFO L87 Difference]: Start difference. First operand 291 states and 303 transitions. Second operand 6 states. [2018-02-02 20:41:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:43,154 INFO L93 Difference]: Finished difference Result 309 states and 324 transitions. [2018-02-02 20:41:43,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:41:43,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-02 20:41:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:43,157 INFO L225 Difference]: With dead ends: 309 [2018-02-02 20:41:43,157 INFO L226 Difference]: Without dead ends: 309 [2018-02-02 20:41:43,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:41:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-02-02 20:41:43,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2018-02-02 20:41:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-02 20:41:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 300 transitions. [2018-02-02 20:41:43,162 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 300 transitions. Word has length 33 [2018-02-02 20:41:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:43,163 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 300 transitions. [2018-02-02 20:41:43,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:41:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 300 transitions. [2018-02-02 20:41:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:41:43,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:43,164 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:41:43,164 INFO L371 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1961365060, now seen corresponding path program 1 times [2018-02-02 20:41:43,164 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:43,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:43,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:43,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:41:43,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:43,257 INFO L182 omatonBuilderFactory]: Interpolants [5920#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset)), 5921#(and (= 8 (select |#length| |inspect_before_#in~shape.base|)) (= 0 |inspect_before_#in~shape.offset|)), 5922#(and (= (select |#length| inspect_before_~shape.base) 8) (= inspect_before_~shape.offset 0)), 5916#true, 5917#false, 5918#(and (= 0 |main_#t~malloc45.offset|) (= 8 (select |#length| |main_#t~malloc45.base|))), 5919#(and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~item~0.offset))] [2018-02-02 20:41:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:43,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:41:43,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:41:43,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:41:43,258 INFO L87 Difference]: Start difference. First operand 286 states and 300 transitions. Second operand 7 states. [2018-02-02 20:41:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:43,696 INFO L93 Difference]: Finished difference Result 359 states and 375 transitions. [2018-02-02 20:41:43,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:41:43,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-02 20:41:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:43,698 INFO L225 Difference]: With dead ends: 359 [2018-02-02 20:41:43,698 INFO L226 Difference]: Without dead ends: 359 [2018-02-02 20:41:43,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:41:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-02-02 20:41:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 322. [2018-02-02 20:41:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-02 20:41:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 339 transitions. [2018-02-02 20:41:43,705 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 339 transitions. Word has length 33 [2018-02-02 20:41:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:43,705 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 339 transitions. [2018-02-02 20:41:43,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:41:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 339 transitions. [2018-02-02 20:41:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:41:43,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:43,707 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:43,707 INFO L371 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:43,707 INFO L82 PathProgramCache]: Analyzing trace with hash 816569686, now seen corresponding path program 1 times [2018-02-02 20:41:43,708 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:43,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:43,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:43,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:41:43,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:43,857 INFO L182 omatonBuilderFactory]: Interpolants [6611#true, 6612#false, 6613#(= 1 (select |#valid| |main_#t~malloc41.base|)), 6614#(= 1 (select |#valid| main_~node~1.base)), 6615#(or (= 1 (select |#valid| main_~node~1.base)) (= |main_#t~malloc45.base| main_~node~1.base)), 6616#(or (= 1 (select |#valid| main_~node~1.base)) (= main_~item~0.base main_~node~1.base)), 6617#(= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))), 6618#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 6619#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))), 6620#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))), 6621#(= 1 (select |#valid| |inspect_before_#t~mem32.base|))] [2018-02-02 20:41:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:43,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:41:43,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:41:43,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:41:43,857 INFO L87 Difference]: Start difference. First operand 322 states and 339 transitions. Second operand 11 states. [2018-02-02 20:41:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:44,458 INFO L93 Difference]: Finished difference Result 336 states and 352 transitions. [2018-02-02 20:41:44,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:41:44,458 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-02 20:41:44,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:44,460 INFO L225 Difference]: With dead ends: 336 [2018-02-02 20:41:44,460 INFO L226 Difference]: Without dead ends: 336 [2018-02-02 20:41:44,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:41:44,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-02 20:41:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 323. [2018-02-02 20:41:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-02 20:41:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 341 transitions. [2018-02-02 20:41:44,465 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 341 transitions. Word has length 48 [2018-02-02 20:41:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:44,465 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 341 transitions. [2018-02-02 20:41:44,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:41:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 341 transitions. [2018-02-02 20:41:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:41:44,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:44,466 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:44,466 INFO L371 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:44,467 INFO L82 PathProgramCache]: Analyzing trace with hash 816569687, now seen corresponding path program 1 times [2018-02-02 20:41:44,467 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:44,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:44,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:44,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:41:44,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:44,631 INFO L182 omatonBuilderFactory]: Interpolants [7296#(and (= 8 (select |#length| |main_#t~malloc41.base|)) (= 0 |main_#t~malloc41.offset|)), 7297#(and (= 0 main_~node~1.offset) (= 8 (select |#length| main_~node~1.base))), 7298#(and (= 0 main_~node~1.offset) (= 8 (select |#length| main_~node~1.base)) (= (select |#valid| main_~node~1.base) 1)), 7299#(and (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset))), 7300#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 7301#(and (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))), 7302#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset))), 7303#(and (= |inspect_before_#t~mem32.offset| 0) (= (select |#length| |inspect_before_#t~mem32.base|) 8)), 7294#true, 7295#false] [2018-02-02 20:41:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:44,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:41:44,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:41:44,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:41:44,632 INFO L87 Difference]: Start difference. First operand 323 states and 341 transitions. Second operand 10 states. [2018-02-02 20:41:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:45,149 INFO L93 Difference]: Finished difference Result 348 states and 364 transitions. [2018-02-02 20:41:45,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:41:45,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-02-02 20:41:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:45,151 INFO L225 Difference]: With dead ends: 348 [2018-02-02 20:41:45,151 INFO L226 Difference]: Without dead ends: 348 [2018-02-02 20:41:45,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:41:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-02-02 20:41:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 323. [2018-02-02 20:41:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-02 20:41:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 340 transitions. [2018-02-02 20:41:45,161 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 340 transitions. Word has length 48 [2018-02-02 20:41:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:45,161 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 340 transitions. [2018-02-02 20:41:45,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:41:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 340 transitions. [2018-02-02 20:41:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:41:45,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:45,161 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:45,162 INFO L371 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:45,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1119918648, now seen corresponding path program 1 times [2018-02-02 20:41:45,162 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:45,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:45,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:45,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:41:45,262 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:45,263 INFO L182 omatonBuilderFactory]: Interpolants [8000#(= (select |#valid| |inspect_before_#t~mem27.base|) 1), 7990#true, 7991#false, 7992#(= 1 (select |#valid| |main_#t~malloc41.base|)), 7993#(= 1 (select |#valid| main_~node~1.base)), 7994#(or (= 1 (select |#valid| main_~node~1.base)) (= |main_#t~malloc45.base| main_~node~1.base)), 7995#(or (= 1 (select |#valid| main_~node~1.base)) (= main_~item~0.base main_~node~1.base)), 7996#(= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))), 7997#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 7998#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))), 7999#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))] [2018-02-02 20:41:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:45,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:41:45,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:41:45,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:41:45,263 INFO L87 Difference]: Start difference. First operand 323 states and 340 transitions. Second operand 11 states. [2018-02-02 20:41:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:45,744 INFO L93 Difference]: Finished difference Result 334 states and 350 transitions. [2018-02-02 20:41:45,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:41:45,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-02 20:41:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:45,745 INFO L225 Difference]: With dead ends: 334 [2018-02-02 20:41:45,745 INFO L226 Difference]: Without dead ends: 334 [2018-02-02 20:41:45,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:41:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-02 20:41:45,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 323. [2018-02-02 20:41:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-02 20:41:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 339 transitions. [2018-02-02 20:41:45,751 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 339 transitions. Word has length 48 [2018-02-02 20:41:45,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:45,751 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 339 transitions. [2018-02-02 20:41:45,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:41:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 339 transitions. [2018-02-02 20:41:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:41:45,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:45,752 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:45,752 INFO L371 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:45,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1119918649, now seen corresponding path program 1 times [2018-02-02 20:41:45,753 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:45,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:45,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:45,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:41:45,897 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:45,898 INFO L182 omatonBuilderFactory]: Interpolants [8672#false, 8673#(and (= 8 (select |#length| |main_#t~malloc41.base|)) (= 0 |main_#t~malloc41.offset|)), 8674#(and (= 0 main_~node~1.offset) (= 8 (select |#length| main_~node~1.base))), 8675#(and (= 0 main_~node~1.offset) (= 8 (select |#length| main_~node~1.base)) (= (select |#valid| main_~node~1.base) 1)), 8676#(and (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset))), 8677#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 8678#(and (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))), 8679#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset))), 8680#(and (= |inspect_before_#t~mem27.offset| 0) (= (select |#length| |inspect_before_#t~mem27.base|) 8)), 8671#true] [2018-02-02 20:41:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:45,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:41:45,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:41:45,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:41:45,898 INFO L87 Difference]: Start difference. First operand 323 states and 339 transitions. Second operand 10 states. [2018-02-02 20:41:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:46,419 INFO L93 Difference]: Finished difference Result 346 states and 362 transitions. [2018-02-02 20:41:46,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:41:46,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-02-02 20:41:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:46,420 INFO L225 Difference]: With dead ends: 346 [2018-02-02 20:41:46,420 INFO L226 Difference]: Without dead ends: 346 [2018-02-02 20:41:46,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:41:46,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-02 20:41:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 323. [2018-02-02 20:41:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-02 20:41:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 338 transitions. [2018-02-02 20:41:46,425 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 338 transitions. Word has length 48 [2018-02-02 20:41:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:46,425 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 338 transitions. [2018-02-02 20:41:46,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:41:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 338 transitions. [2018-02-02 20:41:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:41:46,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:46,428 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:46,428 INFO L371 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:46,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1300121728, now seen corresponding path program 1 times [2018-02-02 20:41:46,429 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:46,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:46,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:41:46,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:41:46,695 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:46,695 INFO L182 omatonBuilderFactory]: Interpolants [9376#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))), 9377#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= |inspect_before_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= |inspect_before_#t~mem29.base| 0)), 9365#true, 9366#false, 9367#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base)), 9368#(and (= 0 |main_#t~malloc41.offset|) (= 0 main_~data~0.offset) (= 0 main_~data~0.base)), 9369#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base) (= main_~node~1.offset 0)), 9370#(and (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset) (= 0 main_~data~0.base) (= main_~node~1.offset 0)), 9371#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base) (= main_~node~1.offset 0) (= main_~item~0.offset 0)), 9372#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base) (= main_~item~0.offset 0)), 9373#(and (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= main_~item~0.offset 0)), 9374#(and (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))), 9375#(and (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (= 0 |inspect_before_#in~shape.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ 0 4))))] [2018-02-02 20:41:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:46,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:41:46,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:41:46,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:41:46,696 INFO L87 Difference]: Start difference. First operand 323 states and 338 transitions. Second operand 13 states. [2018-02-02 20:41:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:47,123 INFO L93 Difference]: Finished difference Result 393 states and 412 transitions. [2018-02-02 20:41:47,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:41:47,123 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-02-02 20:41:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:47,124 INFO L225 Difference]: With dead ends: 393 [2018-02-02 20:41:47,124 INFO L226 Difference]: Without dead ends: 393 [2018-02-02 20:41:47,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:41:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-02-02 20:41:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2018-02-02 20:41:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-02 20:41:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 382 transitions. [2018-02-02 20:41:47,131 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 382 transitions. Word has length 54 [2018-02-02 20:41:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:47,131 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 382 transitions. [2018-02-02 20:41:47,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:41:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 382 transitions. [2018-02-02 20:41:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:41:47,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:47,132 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:47,132 INFO L371 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:47,132 INFO L82 PathProgramCache]: Analyzing trace with hash 387977136, now seen corresponding path program 1 times [2018-02-02 20:41:47,133 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:47,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:41:47,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:47,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:41:47,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:47,170 INFO L182 omatonBuilderFactory]: Interpolants [10151#true, 10152#false, 10153#(= 1 (select |#valid| main_~data~0.base)), 10154#(= 1 (select |#valid| |seq_sort_core_#in~data.base|)), 10155#(= 1 (select |#valid| seq_sort_core_~data.base))] [2018-02-02 20:41:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:41:47,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:41:47,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:41:47,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:41:47,171 INFO L87 Difference]: Start difference. First operand 366 states and 382 transitions. Second operand 5 states. [2018-02-02 20:41:47,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:47,422 INFO L93 Difference]: Finished difference Result 386 states and 405 transitions. [2018-02-02 20:41:47,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:41:47,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-02-02 20:41:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:47,424 INFO L225 Difference]: With dead ends: 386 [2018-02-02 20:41:47,424 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 20:41:47,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:41:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 20:41:47,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 367. [2018-02-02 20:41:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-02-02 20:41:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 385 transitions. [2018-02-02 20:41:47,430 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 385 transitions. Word has length 60 [2018-02-02 20:41:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:47,430 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 385 transitions. [2018-02-02 20:41:47,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:41:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 385 transitions. [2018-02-02 20:41:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:41:47,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:47,431 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:47,431 INFO L371 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:47,431 INFO L82 PathProgramCache]: Analyzing trace with hash 387977137, now seen corresponding path program 1 times [2018-02-02 20:41:47,432 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:47,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:47,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:47,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:41:47,520 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:47,520 INFO L182 omatonBuilderFactory]: Interpolants [10912#false, 10913#(and (= 0 |main_#t~malloc45.offset|) (= 8 (select |#length| |main_#t~malloc45.base|))), 10914#(and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~item~0.offset)), 10915#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset)), 10916#(and (= 0 |seq_sort_core_#in~data.offset|) (= 8 (select |#length| |seq_sort_core_#in~data.base|))), 10917#(and (= seq_sort_core_~data.offset 0) (= (select |#length| seq_sort_core_~data.base) 8)), 10911#true] [2018-02-02 20:41:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:47,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:41:47,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:41:47,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:41:47,521 INFO L87 Difference]: Start difference. First operand 367 states and 385 transitions. Second operand 7 states. [2018-02-02 20:41:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:47,826 INFO L93 Difference]: Finished difference Result 398 states and 420 transitions. [2018-02-02 20:41:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:41:47,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-02-02 20:41:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:47,828 INFO L225 Difference]: With dead ends: 398 [2018-02-02 20:41:47,828 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 20:41:47,828 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:41:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 20:41:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 380. [2018-02-02 20:41:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-02 20:41:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 401 transitions. [2018-02-02 20:41:47,835 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 401 transitions. Word has length 60 [2018-02-02 20:41:47,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:47,835 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 401 transitions. [2018-02-02 20:41:47,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:41:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 401 transitions. [2018-02-02 20:41:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:41:47,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:47,836 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:47,836 INFO L371 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:47,836 INFO L82 PathProgramCache]: Analyzing trace with hash -555377704, now seen corresponding path program 1 times [2018-02-02 20:41:47,837 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:47,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:41:47,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:47,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:41:47,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:47,878 INFO L182 omatonBuilderFactory]: Interpolants [11703#true, 11704#false, 11705#(= 1 (select |#valid| main_~data~0.base)), 11706#(= 1 (select |#valid| |inspect_after_#in~shape.base|)), 11707#(= 1 (select |#valid| inspect_after_~shape.base))] [2018-02-02 20:41:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:41:47,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:41:47,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:41:47,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:41:47,878 INFO L87 Difference]: Start difference. First operand 380 states and 401 transitions. Second operand 5 states. [2018-02-02 20:41:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:48,036 INFO L93 Difference]: Finished difference Result 377 states and 398 transitions. [2018-02-02 20:41:48,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:41:48,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-02-02 20:41:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:48,037 INFO L225 Difference]: With dead ends: 377 [2018-02-02 20:41:48,037 INFO L226 Difference]: Without dead ends: 377 [2018-02-02 20:41:48,037 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:41:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-02 20:41:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-02-02 20:41:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-02-02 20:41:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 398 transitions. [2018-02-02 20:41:48,041 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 398 transitions. Word has length 62 [2018-02-02 20:41:48,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:48,041 INFO L432 AbstractCegarLoop]: Abstraction has 377 states and 398 transitions. [2018-02-02 20:41:48,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:41:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 398 transitions. [2018-02-02 20:41:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:41:48,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:48,041 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:48,041 INFO L371 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:48,042 INFO L82 PathProgramCache]: Analyzing trace with hash -555377703, now seen corresponding path program 1 times [2018-02-02 20:41:48,042 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:48,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:48,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:48,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:41:48,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:48,097 INFO L182 omatonBuilderFactory]: Interpolants [12464#true, 12465#false, 12466#(and (= 0 |main_#t~malloc45.offset|) (= 8 (select |#length| |main_#t~malloc45.base|))), 12467#(and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~item~0.offset)), 12468#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset)), 12469#(and (= 0 |inspect_after_#in~shape.offset|) (= 8 (select |#length| |inspect_after_#in~shape.base|))), 12470#(and (= inspect_after_~shape.offset 0) (= (select |#length| inspect_after_~shape.base) 8))] [2018-02-02 20:41:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:48,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:41:48,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:41:48,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:41:48,098 INFO L87 Difference]: Start difference. First operand 377 states and 398 transitions. Second operand 7 states. [2018-02-02 20:41:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:48,383 INFO L93 Difference]: Finished difference Result 422 states and 443 transitions. [2018-02-02 20:41:48,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:41:48,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-02-02 20:41:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:48,384 INFO L225 Difference]: With dead ends: 422 [2018-02-02 20:41:48,384 INFO L226 Difference]: Without dead ends: 422 [2018-02-02 20:41:48,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:41:48,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-02 20:41:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 403. [2018-02-02 20:41:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-02 20:41:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 430 transitions. [2018-02-02 20:41:48,389 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 430 transitions. Word has length 62 [2018-02-02 20:41:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:48,389 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 430 transitions. [2018-02-02 20:41:48,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:41:48,389 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 430 transitions. [2018-02-02 20:41:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:41:48,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:48,390 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:41:48,390 INFO L371 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:48,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1681231164, now seen corresponding path program 1 times [2018-02-02 20:41:48,390 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:48,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:48,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:41:48,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:41:48,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:48,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:48,555 INFO L182 omatonBuilderFactory]: Interpolants [13312#(and (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))), 13313#(and (= main_~data~0.offset 0) (= |main_#t~mem49.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4))) (= |main_#t~mem49.base| 0)), 13303#true, 13304#false, 13305#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base)), 13306#(and (= 0 |main_#t~malloc41.offset|) (= 0 main_~data~0.offset) (= 0 main_~data~0.base)), 13307#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base) (= main_~node~1.offset 0)), 13308#(and (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset) (= 0 main_~data~0.base) (= main_~node~1.offset 0)), 13309#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base) (= main_~item~0.offset 0) (= main_~node~1.offset 0)), 13310#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base) (= main_~item~0.offset 0)), 13311#(and (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= main_~item~0.offset 0))] [2018-02-02 20:41:48,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:48,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:41:48,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:41:48,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:41:48,556 INFO L87 Difference]: Start difference. First operand 403 states and 430 transitions. Second operand 11 states. [2018-02-02 20:41:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:48,764 INFO L93 Difference]: Finished difference Result 429 states and 457 transitions. [2018-02-02 20:41:48,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:41:48,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-02-02 20:41:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:48,765 INFO L225 Difference]: With dead ends: 429 [2018-02-02 20:41:48,765 INFO L226 Difference]: Without dead ends: 429 [2018-02-02 20:41:48,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:41:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-02-02 20:41:48,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 406. [2018-02-02 20:41:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-02-02 20:41:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 433 transitions. [2018-02-02 20:41:48,769 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 433 transitions. Word has length 64 [2018-02-02 20:41:48,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:48,769 INFO L432 AbstractCegarLoop]: Abstraction has 406 states and 433 transitions. [2018-02-02 20:41:48,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:41:48,769 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 433 transitions. [2018-02-02 20:41:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:41:48,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:48,769 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:48,770 INFO L371 AbstractCegarLoop]: === Iteration 21 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:48,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1652785484, now seen corresponding path program 2 times [2018-02-02 20:41:48,770 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:48,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:49,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:41:49,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:41:49,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:49,046 INFO L182 omatonBuilderFactory]: Interpolants [14176#(= 1 (select |#valid| |inspect_before_#t~mem24.base|)), 14177#(= 1 (select |#valid| inspect_before_~shape.base)), 14161#true, 14162#false, 14163#(= 0 |main_#t~malloc41.offset|), 14164#(= main_~node~1.offset 0), 14165#(and (= 1 (select |#valid| |main_#t~malloc45.base|)) (= main_~node~1.offset 0)), 14166#(and (= 1 (select |#valid| main_~item~0.base)) (= main_~node~1.offset 0)), 14167#(= 1 (select |#valid| main_~item~0.base)), 14168#(= (select |#valid| main_~data~0.base) 1), 14169#(and (or (= 1 (select |#valid| main_~data~0.base)) (= |main_#t~malloc45.base| main_~data~0.base)) (= 0 |main_#t~malloc45.offset|)), 14170#(and (or (= main_~item~0.base main_~data~0.base) (= 1 (select |#valid| main_~data~0.base))) (= main_~item~0.offset 0)), 14171#(and (= 1 (select |#valid| main_~data~0.base)) (= main_~item~0.offset 0)), 14172#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4)))) (= main_~item~0.offset 0)), 14173#(and (= 0 main_~data~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))))), 14174#(and (= 0 |inspect_before_#in~shape.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))))), 14175#(and (= inspect_before_~shape.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))] [2018-02-02 20:41:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:49,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:41:49,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:41:49,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:41:49,047 INFO L87 Difference]: Start difference. First operand 406 states and 433 transitions. Second operand 17 states. [2018-02-02 20:41:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:49,825 INFO L93 Difference]: Finished difference Result 427 states and 455 transitions. [2018-02-02 20:41:49,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:41:49,826 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-02-02 20:41:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:49,827 INFO L225 Difference]: With dead ends: 427 [2018-02-02 20:41:49,827 INFO L226 Difference]: Without dead ends: 427 [2018-02-02 20:41:49,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:41:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-02-02 20:41:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 409. [2018-02-02 20:41:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-02-02 20:41:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 437 transitions. [2018-02-02 20:41:49,832 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 437 transitions. Word has length 70 [2018-02-02 20:41:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:49,832 INFO L432 AbstractCegarLoop]: Abstraction has 409 states and 437 transitions. [2018-02-02 20:41:49,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:41:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 437 transitions. [2018-02-02 20:41:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:41:49,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:49,833 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:49,833 INFO L371 AbstractCegarLoop]: === Iteration 22 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:49,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1652785483, now seen corresponding path program 1 times [2018-02-02 20:41:49,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:49,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:50,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:41:50,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:41:50,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:50,167 INFO L182 omatonBuilderFactory]: Interpolants [15042#true, 15043#false, 15044#(= 0 |main_#t~malloc41.offset|), 15045#(= main_~node~1.offset 0), 15046#(and (= 0 |main_#t~malloc45.offset|) (= 8 (select |#length| |main_#t~malloc45.base|)) (= main_~node~1.offset 0)), 15047#(and (= 0 main_~item~0.offset) (= (select |#length| main_~item~0.base) 8) (= main_~node~1.offset 0)), 15048#(and (= 0 main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= (select |#length| main_~item~0.base) 8)), 15049#(and (<= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset) (= (select |#valid| main_~data~0.base) 1)), 15050#(and (<= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset)), 15051#(and (<= 8 (select |#length| main_~data~0.base)) (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset)), 15052#(and (<= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset) (= main_~item~0.offset 0)), 15053#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= main_~item~0.offset 0)), 15054#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))), 15055#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4)))) (= 0 |inspect_before_#in~shape.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ 0 4)))), 15056#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0)), 15057#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0)), 15058#(and (= 0 |inspect_before_#t~mem24.offset|) (<= 8 (select |#length| |inspect_before_#t~mem24.base|))), 15059#(and (= inspect_before_~shape.offset 0) (<= 8 (select |#length| inspect_before_~shape.base)))] [2018-02-02 20:41:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:50,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:41:50,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:41:50,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:41:50,168 INFO L87 Difference]: Start difference. First operand 409 states and 437 transitions. Second operand 18 states. [2018-02-02 20:41:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:51,060 INFO L93 Difference]: Finished difference Result 490 states and 519 transitions. [2018-02-02 20:41:51,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:41:51,060 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-02-02 20:41:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:51,061 INFO L225 Difference]: With dead ends: 490 [2018-02-02 20:41:51,061 INFO L226 Difference]: Without dead ends: 490 [2018-02-02 20:41:51,062 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=857, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:41:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-02-02 20:41:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 440. [2018-02-02 20:41:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-02 20:41:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 470 transitions. [2018-02-02 20:41:51,066 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 470 transitions. Word has length 70 [2018-02-02 20:41:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:51,066 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 470 transitions. [2018-02-02 20:41:51,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:41:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 470 transitions. [2018-02-02 20:41:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:41:51,066 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:51,066 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:41:51,067 INFO L371 AbstractCegarLoop]: === Iteration 23 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:51,067 INFO L82 PathProgramCache]: Analyzing trace with hash -416395486, now seen corresponding path program 1 times [2018-02-02 20:41:51,067 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:51,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:41:51,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:51,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:41:51,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:51,200 INFO L182 omatonBuilderFactory]: Interpolants [16022#true, 16023#false, 16024#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)), 16025#(= |inspect_before_#t~mem32.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)), 16026#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))), 16027#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 16028#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|))), 16029#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_after_~shape.base) inspect_after_~shape.offset))), 16030#(= 1 (select |#valid| |inspect_after_#t~mem36.base|)), 16031#(= 1 (select |#valid| inspect_after_~pos~0.base))] [2018-02-02 20:41:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:41:51,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:41:51,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:41:51,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:41:51,201 INFO L87 Difference]: Start difference. First operand 440 states and 470 transitions. Second operand 10 states. [2018-02-02 20:41:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:51,572 INFO L93 Difference]: Finished difference Result 483 states and 515 transitions. [2018-02-02 20:41:51,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:41:51,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-02-02 20:41:51,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:51,573 INFO L225 Difference]: With dead ends: 483 [2018-02-02 20:41:51,573 INFO L226 Difference]: Without dead ends: 483 [2018-02-02 20:41:51,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:41:51,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-02 20:41:51,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 474. [2018-02-02 20:41:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-02-02 20:41:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 509 transitions. [2018-02-02 20:41:51,580 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 509 transitions. Word has length 73 [2018-02-02 20:41:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:51,580 INFO L432 AbstractCegarLoop]: Abstraction has 474 states and 509 transitions. [2018-02-02 20:41:51,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:41:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 509 transitions. [2018-02-02 20:41:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:41:51,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:51,581 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:41:51,581 INFO L371 AbstractCegarLoop]: === Iteration 24 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:51,581 INFO L82 PathProgramCache]: Analyzing trace with hash -416395485, now seen corresponding path program 1 times [2018-02-02 20:41:51,582 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:51,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:51,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:51,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:41:51,755 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:51,756 INFO L182 omatonBuilderFactory]: Interpolants [17001#true, 17002#false, 17003#(= 0 |main_#t~malloc41.offset|), 17004#(= 0 main_~node~1.offset), 17005#(= 0 (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset)), 17006#(= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)), 17007#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)), 17008#(= |inspect_before_#t~mem32.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)), 17009#(<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))), 17010#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 17011#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|))), 17012#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| inspect_after_~shape.base) inspect_after_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_after_~shape.base) inspect_after_~shape.offset))), 17013#(and (<= 4 (select |#length| |inspect_after_#t~mem36.base|)) (= 0 |inspect_after_#t~mem36.offset|)), 17014#(and (= inspect_after_~pos~0.offset 0) (<= 4 (select |#length| inspect_after_~pos~0.base)))] [2018-02-02 20:41:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:51,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:41:51,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:41:51,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:41:51,756 INFO L87 Difference]: Start difference. First operand 474 states and 509 transitions. Second operand 14 states. [2018-02-02 20:41:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:52,399 INFO L93 Difference]: Finished difference Result 517 states and 550 transitions. [2018-02-02 20:41:52,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:41:52,399 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2018-02-02 20:41:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:52,400 INFO L225 Difference]: With dead ends: 517 [2018-02-02 20:41:52,400 INFO L226 Difference]: Without dead ends: 517 [2018-02-02 20:41:52,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:41:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-02-02 20:41:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 478. [2018-02-02 20:41:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-02-02 20:41:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 513 transitions. [2018-02-02 20:41:52,406 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 513 transitions. Word has length 73 [2018-02-02 20:41:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:52,406 INFO L432 AbstractCegarLoop]: Abstraction has 478 states and 513 transitions. [2018-02-02 20:41:52,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:41:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 513 transitions. [2018-02-02 20:41:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:41:52,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:52,406 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:41:52,406 INFO L371 AbstractCegarLoop]: === Iteration 25 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:52,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2030774639, now seen corresponding path program 1 times [2018-02-02 20:41:52,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:52,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:41:52,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:52,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 20:41:52,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:52,565 INFO L182 omatonBuilderFactory]: Interpolants [18032#false, 18033#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)), 18034#(and (= |inspect_before_#t~mem32.offset| (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (= |inspect_before_#t~mem32.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))), 18035#(and (= |inspect_before_#t~mem33.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))) (= |inspect_before_#t~mem33.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))), 18036#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))), 18037#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 18038#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|)))), 18039#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_after_~shape.base) inspect_after_~shape.offset)) (select (select |#memory_$Pointer$.offset| inspect_after_~shape.base) inspect_after_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_after_~shape.base) inspect_after_~shape.offset)) (select (select |#memory_$Pointer$.offset| inspect_after_~shape.base) inspect_after_~shape.offset)))), 18040#(and (= 0 (select (select |#memory_$Pointer$.offset| |inspect_after_#t~mem36.base|) |inspect_after_#t~mem36.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |inspect_after_#t~mem36.base|) |inspect_after_#t~mem36.offset|))), 18041#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_after_~pos~0.base) inspect_after_~pos~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| inspect_after_~pos~0.base) inspect_after_~pos~0.offset))), 18042#(and (= |inspect_after_#t~mem38.offset| 0) (= |inspect_after_#t~mem38.base| 0)), 18031#true] [2018-02-02 20:41:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:41:52,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:41:52,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:41:52,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:41:52,566 INFO L87 Difference]: Start difference. First operand 478 states and 513 transitions. Second operand 12 states. [2018-02-02 20:41:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:52,937 INFO L93 Difference]: Finished difference Result 487 states and 518 transitions. [2018-02-02 20:41:52,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:41:52,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2018-02-02 20:41:52,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:52,939 INFO L225 Difference]: With dead ends: 487 [2018-02-02 20:41:52,939 INFO L226 Difference]: Without dead ends: 487 [2018-02-02 20:41:52,940 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:41:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-02-02 20:41:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 470. [2018-02-02 20:41:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-02-02 20:41:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 499 transitions. [2018-02-02 20:41:52,946 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 499 transitions. Word has length 78 [2018-02-02 20:41:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:52,946 INFO L432 AbstractCegarLoop]: Abstraction has 470 states and 499 transitions. [2018-02-02 20:41:52,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:41:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 499 transitions. [2018-02-02 20:41:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 20:41:52,947 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:52,947 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:52,947 INFO L371 AbstractCegarLoop]: === Iteration 26 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:52,947 INFO L82 PathProgramCache]: Analyzing trace with hash -891514256, now seen corresponding path program 2 times [2018-02-02 20:41:52,948 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:52,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:53,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:41:53,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:41:53,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:53,201 INFO L182 omatonBuilderFactory]: Interpolants [19014#true, 19015#false, 19016#(= 0 |main_#t~malloc41.offset|), 19017#(= main_~node~1.offset 0), 19018#(and (not (= 0 |main_#t~malloc45.base|)) (= main_~node~1.offset 0)), 19019#(and (not (= 0 main_~item~0.base)) (= main_~node~1.offset 0)), 19020#(not (= 0 main_~item~0.base)), 19021#(not (= 0 main_~data~0.base)), 19022#(and (= 0 |main_#t~malloc45.offset|) (not (= 0 main_~data~0.base))), 19023#(and (not (= 0 main_~data~0.base)) (= main_~item~0.offset 0)), 19024#(and (= 0 main_~item~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ 0 4))))), 19025#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (= 0 main_~data~0.offset)), 19026#(and (or (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.offset 0)) (or (not (= inspect_before_~shape.offset 0)) (= inspect_before_~shape.base |inspect_before_#in~shape.base|))), 19027#(and (or (= inspect_before_~shape.offset 0) (= |inspect_before_#in~shape.offset| inspect_before_~shape.offset)) (or (and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem29.base|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)) (not (= inspect_before_~shape.offset 0)))), 19028#(and (or (= inspect_before_~shape.offset 0) (= |inspect_before_#in~shape.offset| inspect_before_~shape.offset)) (or (and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)) (not (= inspect_before_~shape.offset 0)))), 19029#(and (or (= inspect_before_~shape.offset 0) (not (= |inspect_before_#in~shape.offset| 0))) (or (and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)) (not (= inspect_before_~shape.offset 0)))), 19030#(or (not (= |inspect_before_#in~shape.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ (- 0) 4))))] [2018-02-02 20:41:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:53,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:41:53,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:41:53,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:41:53,202 INFO L87 Difference]: Start difference. First operand 470 states and 499 transitions. Second operand 17 states. [2018-02-02 20:41:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:53,546 INFO L93 Difference]: Finished difference Result 506 states and 533 transitions. [2018-02-02 20:41:53,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:41:53,546 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2018-02-02 20:41:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:53,547 INFO L225 Difference]: With dead ends: 506 [2018-02-02 20:41:53,547 INFO L226 Difference]: Without dead ends: 488 [2018-02-02 20:41:53,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:41:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-02-02 20:41:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 449. [2018-02-02 20:41:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-02-02 20:41:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 476 transitions. [2018-02-02 20:41:53,551 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 476 transitions. Word has length 80 [2018-02-02 20:41:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:53,551 INFO L432 AbstractCegarLoop]: Abstraction has 449 states and 476 transitions. [2018-02-02 20:41:53,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:41:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 476 transitions. [2018-02-02 20:41:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:41:53,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:53,552 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:41:53,552 INFO L371 AbstractCegarLoop]: === Iteration 27 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2087785373, now seen corresponding path program 1 times [2018-02-02 20:41:53,553 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:53,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:53,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:53,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:41:53,728 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:53,728 INFO L182 omatonBuilderFactory]: Interpolants [20004#true, 20005#false, 20006#(= 1 (select |#valid| main_~node~1.base)), 20007#(and (not (= 0 |main_#t~malloc45.base|)) (not (= |main_#t~malloc45.base| main_~node~1.base))), 20008#(and (not (= main_~item~0.base main_~node~1.base)) (not (= 0 main_~item~0.base))), 20009#(and (not (= main_~item~0.base (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))) (not (= 0 main_~item~0.base))), 20010#(and (not (= 0 main_~data~0.base)) (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 20011#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)), 20012#(= |inspect_before_#t~mem32.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)), 20013#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))), 20014#(and (= 1 (select (store |#valid| main_~data~0.base 0) (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (not (= 0 main_~data~0.base))), 20015#(and (not (= 0 main_~data~0.base)) (= 1 (select (store |#valid| main_~data~0.base 0) |main_#t~mem50.base|))), 20016#(and (not (= 0 main_~data~0.base)) (= 1 (select (store |#valid| main_~data~0.base 0) main_~node~2.base))), 20017#(= 1 (select |#valid| main_~node~2.base))] [2018-02-02 20:41:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:53,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:41:53,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:41:53,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:41:53,729 INFO L87 Difference]: Start difference. First operand 449 states and 476 transitions. Second operand 14 states. [2018-02-02 20:41:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:54,259 INFO L93 Difference]: Finished difference Result 473 states and 500 transitions. [2018-02-02 20:41:54,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:41:54,260 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2018-02-02 20:41:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:54,261 INFO L225 Difference]: With dead ends: 473 [2018-02-02 20:41:54,261 INFO L226 Difference]: Without dead ends: 473 [2018-02-02 20:41:54,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:41:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-02 20:41:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 454. [2018-02-02 20:41:54,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-02-02 20:41:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 483 transitions. [2018-02-02 20:41:54,265 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 483 transitions. Word has length 86 [2018-02-02 20:41:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:54,266 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 483 transitions. [2018-02-02 20:41:54,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:41:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 483 transitions. [2018-02-02 20:41:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:41:54,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:54,267 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:41:54,267 INFO L371 AbstractCegarLoop]: === Iteration 28 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:54,267 INFO L82 PathProgramCache]: Analyzing trace with hash -2087785372, now seen corresponding path program 1 times [2018-02-02 20:41:54,268 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:54,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:54,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:54,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:41:54,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:54,452 INFO L182 omatonBuilderFactory]: Interpolants [20980#true, 20981#false, 20982#(= 0 |main_#t~malloc41.offset|), 20983#(= 0 main_~node~1.offset), 20984#(= 0 (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset)), 20985#(= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)), 20986#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)), 20987#(= |inspect_before_#t~mem32.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)), 20988#(<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))), 20989#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 20990#(and (= 0 |main_#t~mem50.offset|) (<= 4 (select |#length| |main_#t~mem50.base|))), 20991#(and (= 0 main_~node~2.offset) (<= 4 (select |#length| main_~node~2.base)))] [2018-02-02 20:41:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:54,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:41:54,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:41:54,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:41:54,453 INFO L87 Difference]: Start difference. First operand 454 states and 483 transitions. Second operand 12 states. [2018-02-02 20:41:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:54,853 INFO L93 Difference]: Finished difference Result 484 states and 511 transitions. [2018-02-02 20:41:54,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:41:54,854 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2018-02-02 20:41:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:54,855 INFO L225 Difference]: With dead ends: 484 [2018-02-02 20:41:54,855 INFO L226 Difference]: Without dead ends: 484 [2018-02-02 20:41:54,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:41:54,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-02-02 20:41:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 456. [2018-02-02 20:41:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-02-02 20:41:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 484 transitions. [2018-02-02 20:41:54,861 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 484 transitions. Word has length 86 [2018-02-02 20:41:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:54,862 INFO L432 AbstractCegarLoop]: Abstraction has 456 states and 484 transitions. [2018-02-02 20:41:54,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:41:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 484 transitions. [2018-02-02 20:41:54,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:41:54,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:54,862 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:54,863 INFO L371 AbstractCegarLoop]: === Iteration 29 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:54,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1341367099, now seen corresponding path program 1 times [2018-02-02 20:41:54,863 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:54,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:55,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:41:55,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:41:55,652 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:55,652 INFO L182 omatonBuilderFactory]: Interpolants [21952#false, 21953#(and (= 1 (select |#valid| |main_#t~malloc41.base|)) (= 0 |main_#t~malloc41.offset|)), 21954#(and (= 1 (select |#valid| main_~node~1.base)) (= main_~node~1.offset 0)), 21955#(and (= 1 (select |#valid| main_~node~1.base)) (= 0 |main_#t~malloc45.offset|) (= main_~node~1.offset 0)), 21956#(and (= 1 (select |#valid| main_~node~1.base)) (= main_~node~1.offset 0) (= main_~item~0.offset 0)), 21957#(and (= 1 (select |#valid| main_~item~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))) (= main_~item~0.offset 0)), 21958#(and (= 1 (select |#valid| main_~data~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 main_~data~0.offset)), 21959#(and (not (= main_~data~0.base |main_#t~malloc41.base|)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= |main_#t~malloc41.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 main_~data~0.offset)), 21960#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0))) (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0))) (not (= main_~node~1.base main_~data~0.base)) (= 0 main_~data~0.offset)), 21961#(and (= 0 main_~data~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= main_~node~1.base (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)))), 21962#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= |main_#t~malloc45.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)) (= |main_#t~malloc45.base| main_~data~0.base) (= main_~node~1.base (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset)), 21963#(and (or (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) 0)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) 0))) (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) 0))) (= 0 main_~data~0.offset) (= main_~item~0.offset 0)), 21964#(and (= 0 main_~data~0.offset) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) 0))) (= (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) 0))) (= main_~item~0.offset 0)), 21965#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (or (= (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0)))) (= main_~item~0.offset 0)), 21966#(and (= 0 main_~data~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))) (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))), 21967#(and (or (= (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) 0)))) (= 0 |inspect_before_#in~shape.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ 0 4)))), 21968#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0)), 21969#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.offset|)), 21970#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (or (= |inspect_before_#t~mem27.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))) (= inspect_before_~shape.offset 0)), 21971#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))), 21972#(and (= 0 |inspect_before_#t~mem24.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|)))), 21973#(and (not (= 1 inspect_before_~shape.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))), 21974#(= 1 (select |#valid| |inspect_before_#t~mem32.base|)), 21951#true] [2018-02-02 20:41:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:55,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:41:55,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:41:55,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:41:55,653 INFO L87 Difference]: Start difference. First operand 456 states and 484 transitions. Second operand 24 states. [2018-02-02 20:41:57,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:57,451 INFO L93 Difference]: Finished difference Result 469 states and 495 transitions. [2018-02-02 20:41:57,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:41:57,451 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2018-02-02 20:41:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:57,452 INFO L225 Difference]: With dead ends: 469 [2018-02-02 20:41:57,452 INFO L226 Difference]: Without dead ends: 469 [2018-02-02 20:41:57,453 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=291, Invalid=1601, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:41:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-02 20:41:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 457. [2018-02-02 20:41:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-02-02 20:41:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 486 transitions. [2018-02-02 20:41:57,457 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 486 transitions. Word has length 85 [2018-02-02 20:41:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:57,457 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 486 transitions. [2018-02-02 20:41:57,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:41:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 486 transitions. [2018-02-02 20:41:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:41:57,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:57,458 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:57,458 INFO L371 AbstractCegarLoop]: === Iteration 30 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:41:57,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1341367098, now seen corresponding path program 1 times [2018-02-02 20:41:57,459 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:57,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:58,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:41:58,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:41:58,554 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:58,555 INFO L182 omatonBuilderFactory]: Interpolants [22943#true, 22944#false, 22945#(and (= 0 |main_#t~malloc41.offset|) (= (select |#length| |main_#t~malloc41.base|) 8)), 22946#(and (= (select |#length| main_~node~1.base) 8) (= main_~node~1.offset 0)), 22947#(and (= 1 (select |#valid| main_~node~1.base)) (= (select |#length| main_~node~1.base) 8) (= main_~node~1.offset 0)), 22948#(and (= 0 |main_#t~malloc45.offset|) (= (select |#length| main_~node~1.base) 8) (= main_~node~1.offset 0)), 22949#(and (= (select |#length| main_~node~1.base) 8) (= main_~node~1.offset 0) (= main_~item~0.offset 0)), 22950#(and (= (select |#length| (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset)) 8) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset)) (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset 0)), 22951#(and (= 1 (select |#valid| main_~data~0.base)) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)) 8) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 main_~data~0.offset)), 22952#(and (= 8 (select |#length| |main_#t~malloc41.base|)) (= 0 |main_#t~malloc41.offset|) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)) 8) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (not (= main_~data~0.base |main_#t~malloc41.base|)) (= 0 main_~data~0.offset)), 22953#(and (= (select |#length| (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0)) 8) (not (= main_~node~1.base main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 main_~node~1.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~node~1.base (store (select |#memory_$Pointer$.offset| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0)) (= 8 (select |#length| main_~node~1.base))), 22954#(and (= 1 (select |#valid| main_~node~1.base)) (not (= main_~node~1.base main_~data~0.base)) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)) 8) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 main_~data~0.offset) (= 0 main_~node~1.offset) (= 8 (select |#length| main_~node~1.base))), 22955#(and (= 1 (select |#valid| main_~node~1.base)) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)) 8) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 main_~data~0.offset) (= 0 main_~node~1.offset) (= 8 (select |#length| main_~node~1.base))), 22956#(and (or (and (= 0 main_~node~1.offset) (= |main_#t~malloc45.base| main_~data~0.base)) (and (not (= main_~data~0.base |main_#t~malloc45.base|)) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)) 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset) (= 8 (select |#length| main_~node~1.base))), 22957#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset main_~node~1.offset)) main_~data~0.base) 0)) (= (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) 0)) 8) (= 0 main_~data~0.offset) (= 8 (select |#length| main_~node~1.base)) (= main_~item~0.offset 0)), 22958#(and (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))) (= (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) 0)) 8) (= 0 main_~data~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset)) main_~data~0.base) 0)) (= main_~item~0.offset 0)), 22959#(and (= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0)) 8) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0)) (= main_~item~0.offset 0)), 22960#(and (= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)) 8) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))), 22961#(and (= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) 0)) 8) (= 0 |inspect_before_#in~shape.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) 0))), 22962#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= inspect_before_~shape.offset 0) (= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) 8)), 22963#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) 8) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.offset|)), 22964#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= 8 (select |#length| |inspect_before_#t~mem27.base|)) (= (select |#length| |inspect_before_#t~mem27.base|) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))), 22965#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (and (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))))), 22966#(and (= 0 |inspect_before_#t~mem24.offset|) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|))), 22967#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (not (= 1 inspect_before_~shape.offset))), 22968#(and (<= 4 (select |#length| |inspect_before_#t~mem32.base|)) (= |inspect_before_#t~mem32.offset| 0))] [2018-02-02 20:41:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:58,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:41:58,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:41:58,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:41:58,556 INFO L87 Difference]: Start difference. First operand 457 states and 486 transitions. Second operand 26 states. [2018-02-02 20:42:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:00,715 INFO L93 Difference]: Finished difference Result 492 states and 518 transitions. [2018-02-02 20:42:00,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:42:00,716 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 85 [2018-02-02 20:42:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:00,716 INFO L225 Difference]: With dead ends: 492 [2018-02-02 20:42:00,716 INFO L226 Difference]: Without dead ends: 492 [2018-02-02 20:42:00,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=358, Invalid=1898, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:42:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-02-02 20:42:00,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 457. [2018-02-02 20:42:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-02-02 20:42:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 485 transitions. [2018-02-02 20:42:00,720 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 485 transitions. Word has length 85 [2018-02-02 20:42:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:00,720 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 485 transitions. [2018-02-02 20:42:00,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:42:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 485 transitions. [2018-02-02 20:42:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:42:00,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:00,721 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:00,721 INFO L371 AbstractCegarLoop]: === Iteration 31 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1038018137, now seen corresponding path program 1 times [2018-02-02 20:42:00,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:00,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:01,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:01,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:42:01,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:01,826 INFO L182 omatonBuilderFactory]: Interpolants [23968#(and (= 1 (select |#valid| main_~node~1.base)) (= 0 |main_#t~malloc45.offset|) (= main_~node~1.offset 0)), 23969#(and (= 1 (select |#valid| main_~node~1.base)) (= main_~node~1.offset 0) (= main_~item~0.offset 0)), 23970#(and (= 1 (select |#valid| main_~item~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))) (= main_~item~0.offset 0)), 23971#(and (= 1 (select |#valid| main_~data~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 main_~data~0.offset)), 23972#(and (not (= main_~data~0.base |main_#t~malloc41.base|)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= |main_#t~malloc41.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 main_~data~0.offset)), 23973#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0))) (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0))) (not (= main_~node~1.base main_~data~0.base)) (= 0 main_~data~0.offset)), 23974#(and (= 0 main_~data~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= main_~node~1.base (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)))), 23975#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= |main_#t~malloc45.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)) (= |main_#t~malloc45.base| main_~data~0.base) (= main_~node~1.base (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset)), 23976#(and (or (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) 0)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) 0))) (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) 0))) (= 0 main_~data~0.offset) (= main_~item~0.offset 0)), 23977#(and (= 0 main_~data~0.offset) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) 0))) (= (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) 0))) (= main_~item~0.offset 0)), 23978#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (or (= (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0)))) (= main_~item~0.offset 0)), 23979#(and (= 0 main_~data~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))) (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))), 23980#(and (or (= (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) 0)))) (= 0 |inspect_before_#in~shape.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ 0 4)))), 23981#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0)), 23982#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem29.offset|)), 23983#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (or (= |inspect_before_#t~mem27.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))) (= inspect_before_~shape.offset 0)), 23984#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))), 23985#(and (= 0 |inspect_before_#t~mem24.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|)))), 23986#(and (not (= 1 inspect_before_~shape.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))), 23987#(= (select |#valid| |inspect_before_#t~mem27.base|) 1), 23964#true, 23965#false, 23966#(and (= 1 (select |#valid| |main_#t~malloc41.base|)) (= 0 |main_#t~malloc41.offset|)), 23967#(and (= 1 (select |#valid| main_~node~1.base)) (= main_~node~1.offset 0))] [2018-02-02 20:42:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:01,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:42:01,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:42:01,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:42:01,827 INFO L87 Difference]: Start difference. First operand 457 states and 485 transitions. Second operand 24 states. [2018-02-02 20:42:04,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:04,037 INFO L93 Difference]: Finished difference Result 467 states and 493 transitions. [2018-02-02 20:42:04,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:42:04,037 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2018-02-02 20:42:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:04,038 INFO L225 Difference]: With dead ends: 467 [2018-02-02 20:42:04,038 INFO L226 Difference]: Without dead ends: 467 [2018-02-02 20:42:04,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=302, Invalid=1678, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:42:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-02 20:42:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 457. [2018-02-02 20:42:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-02-02 20:42:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 484 transitions. [2018-02-02 20:42:04,042 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 484 transitions. Word has length 85 [2018-02-02 20:42:04,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:04,042 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 484 transitions. [2018-02-02 20:42:04,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:42:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 484 transitions. [2018-02-02 20:42:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:42:04,042 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:04,043 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:04,043 INFO L371 AbstractCegarLoop]: === Iteration 32 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:04,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1038018136, now seen corresponding path program 1 times [2018-02-02 20:42:04,043 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:04,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:04,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:04,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:42:04,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:04,999 INFO L182 omatonBuilderFactory]: Interpolants [24960#(and (= 1 (select |#valid| main_~node~1.base)) (= 8 (select |#length| main_~node~1.base)) (= main_~node~1.offset 0)), 24961#(and (= 0 |main_#t~malloc45.offset|) (= 8 (select |#length| main_~node~1.base)) (= main_~node~1.offset 0)), 24962#(and (= 8 (select |#length| main_~node~1.base)) (= main_~node~1.offset 0) (= main_~item~0.offset 0)), 24963#(and (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset)) (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset 0)), 24964#(and (= 1 (select |#valid| main_~data~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 main_~data~0.offset)), 24965#(and (= 8 (select |#length| |main_#t~malloc41.base|)) (= 0 |main_#t~malloc41.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (not (= main_~data~0.base |main_#t~malloc41.base|)) (= 0 main_~data~0.offset)), 24966#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0))) (not (= main_~node~1.base main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 main_~node~1.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~node~1.base (store (select |#memory_$Pointer$.offset| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0)) (= 8 (select |#length| main_~node~1.base))), 24967#(and (= 1 (select |#valid| main_~node~1.base)) (not (= main_~node~1.base main_~data~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 main_~data~0.offset) (= 0 main_~node~1.offset) (= 8 (select |#length| main_~node~1.base))), 24968#(and (= 1 (select |#valid| main_~node~1.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 main_~data~0.offset) (= 0 main_~node~1.offset) (= 8 (select |#length| main_~node~1.base))), 24969#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset) (= 0 main_~node~1.offset) (= 8 (select |#length| main_~node~1.base))), 24970#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) 0))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset main_~node~1.offset)) main_~data~0.base) 0)) (= 0 main_~data~0.offset) (= main_~item~0.offset 0)), 24971#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) 0))) (= 0 main_~data~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset)) main_~data~0.base) 0)) (= main_~item~0.offset 0)), 24972#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0)) (= main_~item~0.offset 0)), 24973#(and (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)))), 24974#(and (= 0 |inspect_before_#in~shape.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) 0)))), 24975#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)))), 24976#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)))), 24977#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|))) (= 0 |inspect_before_#t~mem24.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|))), 24978#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (not (= 1 inspect_before_~shape.offset))), 24979#(and (= |inspect_before_#t~mem27.offset| 0) (= (select |#length| |inspect_before_#t~mem27.base|) 8)), 24956#true, 24957#false, 24958#(and (= 8 (select |#length| |main_#t~malloc41.base|)) (= 0 |main_#t~malloc41.offset|)), 24959#(and (= 8 (select |#length| main_~node~1.base)) (= main_~node~1.offset 0))] [2018-02-02 20:42:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:04,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:42:04,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:42:04,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:42:04,999 INFO L87 Difference]: Start difference. First operand 457 states and 484 transitions. Second operand 24 states. [2018-02-02 20:42:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:07,036 INFO L93 Difference]: Finished difference Result 490 states and 516 transitions. [2018-02-02 20:42:07,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:42:07,036 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2018-02-02 20:42:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:07,037 INFO L225 Difference]: With dead ends: 490 [2018-02-02 20:42:07,037 INFO L226 Difference]: Without dead ends: 490 [2018-02-02 20:42:07,038 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=345, Invalid=1635, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:42:07,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-02-02 20:42:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 457. [2018-02-02 20:42:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-02-02 20:42:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 483 transitions. [2018-02-02 20:42:07,042 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 483 transitions. Word has length 85 [2018-02-02 20:42:07,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:07,042 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 483 transitions. [2018-02-02 20:42:07,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:42:07,042 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 483 transitions. [2018-02-02 20:42:07,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:42:07,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:07,043 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:07,043 INFO L371 AbstractCegarLoop]: === Iteration 33 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:07,043 INFO L82 PathProgramCache]: Analyzing trace with hash -296838353, now seen corresponding path program 1 times [2018-02-02 20:42:07,043 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:07,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:07,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:42:07,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:42:07,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:07,145 INFO L182 omatonBuilderFactory]: Interpolants [25971#true, 25972#false, 25973#(not (= 0 |main_#t~malloc41.base|)), 25974#(not (= 0 main_~node~1.base)), 25975#(not (= 0 (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))), 25976#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 25977#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)), 25978#(not (= 0 |main_#t~mem50.base|)), 25979#(not (= 0 main_~node~2.base))] [2018-02-02 20:42:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:07,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:42:07,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:42:07,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:42:07,146 INFO L87 Difference]: Start difference. First operand 457 states and 483 transitions. Second operand 9 states. [2018-02-02 20:42:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:07,325 INFO L93 Difference]: Finished difference Result 478 states and 503 transitions. [2018-02-02 20:42:07,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:42:07,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-02-02 20:42:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:07,326 INFO L225 Difference]: With dead ends: 478 [2018-02-02 20:42:07,327 INFO L226 Difference]: Without dead ends: 478 [2018-02-02 20:42:07,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:42:07,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-02-02 20:42:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 459. [2018-02-02 20:42:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-02-02 20:42:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 484 transitions. [2018-02-02 20:42:07,331 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 484 transitions. Word has length 87 [2018-02-02 20:42:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:07,331 INFO L432 AbstractCegarLoop]: Abstraction has 459 states and 484 transitions. [2018-02-02 20:42:07,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:42:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 484 transitions. [2018-02-02 20:42:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 20:42:07,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:07,332 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:07,332 INFO L371 AbstractCegarLoop]: === Iteration 34 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash 802425175, now seen corresponding path program 1 times [2018-02-02 20:42:07,333 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:07,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:07,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:07,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:42:07,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:07,599 INFO L182 omatonBuilderFactory]: Interpolants [26944#(and (= 0 main_~snext~0.offset) (= 0 main_~snext~0.base)), 26945#(and (= 0 main_~node~2.base) (= 0 main_~node~2.offset)), 26928#true, 26929#false, 26930#(= |main_#t~malloc41.offset| 0), 26931#(= main_~node~1.offset 0), 26932#(= (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset) 0), 26933#(= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0), 26934#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)), 26935#(and (= |inspect_before_#t~mem32.offset| (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (= |inspect_before_#t~mem32.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))), 26936#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) |inspect_before_#t~mem33.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) |inspect_before_#t~mem33.base|)), 26937#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))), 26938#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 0))), 26939#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem50.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem50.base|) 0))), 26940#(and (= 0 (select (select |#memory_$Pointer$.base| main_~node~2.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~node~2.base) 0))), 26941#(or (not (= 0 main_~node~2.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~node~2.base) main_~node~2.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~node~2.base) main_~node~2.offset)))), 26942#(or (and (= 0 |main_#t~mem51.base|) (= 0 |main_#t~mem51.offset|)) (not (= 0 main_~node~2.offset))), 26943#(or (not (= 0 main_~node~2.offset)) (and (= 0 main_~snext~0.offset) (= 0 main_~snext~0.base)))] [2018-02-02 20:42:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:07,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:42:07,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:42:07,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:42:07,600 INFO L87 Difference]: Start difference. First operand 459 states and 484 transitions. Second operand 18 states. [2018-02-02 20:42:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:08,285 INFO L93 Difference]: Finished difference Result 477 states and 501 transitions. [2018-02-02 20:42:08,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:42:08,285 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 92 [2018-02-02 20:42:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:08,286 INFO L225 Difference]: With dead ends: 477 [2018-02-02 20:42:08,286 INFO L226 Difference]: Without dead ends: 477 [2018-02-02 20:42:08,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:42:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-02-02 20:42:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 462. [2018-02-02 20:42:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-02-02 20:42:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 487 transitions. [2018-02-02 20:42:08,290 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 487 transitions. Word has length 92 [2018-02-02 20:42:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:08,290 INFO L432 AbstractCegarLoop]: Abstraction has 462 states and 487 transitions. [2018-02-02 20:42:08,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:42:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 487 transitions. [2018-02-02 20:42:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 20:42:08,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:08,291 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:08,292 INFO L371 AbstractCegarLoop]: === Iteration 35 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:08,292 INFO L82 PathProgramCache]: Analyzing trace with hash -334022481, now seen corresponding path program 3 times [2018-02-02 20:42:08,292 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:08,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:09,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:09,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:42:09,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:09,000 INFO L182 omatonBuilderFactory]: Interpolants [27936#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4)))), 27937#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4))) (= 0 |inspect_before_#in~shape.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4)))), 27938#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))), 27939#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= |inspect_before_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))), 27940#(and (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) (+ 0 4))) (= 0 |inspect_before_#t~mem24.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#t~mem24.base|) (+ 0 4)))), 27941#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))), 27942#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= |inspect_before_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= |inspect_before_#t~mem29.base| 0)), 27943#(<= (+ inspect_before_~shape.offset 1) 0), 27920#true, 27921#false, 27922#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base)), 27923#(and (= 0 |main_#t~malloc41.offset|) (= 0 main_~data~0.offset) (= 0 main_~data~0.base)), 27924#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base) (= main_~node~1.offset 0)), 27925#(and (= 1 (select |#valid| |main_#t~malloc45.base|)) (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset) (= 0 main_~data~0.base) (= main_~node~1.offset 0)), 27926#(and (= 0 main_~data~0.offset) (= 1 (select |#valid| main_~item~0.base)) (= 0 main_~data~0.base) (= main_~node~1.offset 0) (= main_~item~0.offset 0)), 27927#(and (= 0 main_~data~0.offset) (= 1 (select |#valid| main_~item~0.base)) (= 0 main_~data~0.base) (= main_~item~0.offset 0)), 27928#(and (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset 0)), 27929#(and (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (= 1 (select |#valid| main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))), 27930#(and (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (= 1 (select |#valid| main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc41.base|)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))), 27931#(and (not (= main_~node~1.base main_~data~0.base)) (= 1 (select |#valid| main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~node~1.base (store (select |#memory_$Pointer$.offset| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))) (= 0 main_~data~0.offset) (= 0 (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4)))), 27932#(and (not (= main_~data~0.base |main_#t~malloc45.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))), 27933#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset main_~node~1.offset)) main_~data~0.base) (+ 0 4))) (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (= main_~item~0.offset 0)), 27934#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset)) main_~data~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4))) (= 0 main_~data~0.offset) (= main_~item~0.offset 0)), 27935#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) (= main_~item~0.offset 0))] [2018-02-02 20:42:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:09,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:42:09,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:42:09,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:42:09,001 INFO L87 Difference]: Start difference. First operand 462 states and 487 transitions. Second operand 24 states. [2018-02-02 20:42:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:09,983 INFO L93 Difference]: Finished difference Result 552 states and 582 transitions. [2018-02-02 20:42:09,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:42:09,984 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 91 [2018-02-02 20:42:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:09,985 INFO L225 Difference]: With dead ends: 552 [2018-02-02 20:42:09,985 INFO L226 Difference]: Without dead ends: 552 [2018-02-02 20:42:09,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=1466, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:42:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-02-02 20:42:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 526. [2018-02-02 20:42:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-02-02 20:42:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 552 transitions. [2018-02-02 20:42:09,989 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 552 transitions. Word has length 91 [2018-02-02 20:42:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:09,989 INFO L432 AbstractCegarLoop]: Abstraction has 526 states and 552 transitions. [2018-02-02 20:42:09,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:42:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 552 transitions. [2018-02-02 20:42:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 20:42:09,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:09,989 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:09,989 INFO L371 AbstractCegarLoop]: === Iteration 36 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash -894624581, now seen corresponding path program 1 times [2018-02-02 20:42:09,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:10,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:10,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:10,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:42:10,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:10,417 INFO L182 omatonBuilderFactory]: Interpolants [29056#true, 29057#false, 29058#(= |#valid| |old(#valid)|), 29059#(= (store |#valid| |main_#t~malloc41.base| 0) |old(#valid)|), 29060#(= |old(#valid)| (store |#valid| main_~node~1.base 0)), 29061#(and (not (= 0 |main_#t~malloc45.base|)) (or (= (store (store |#valid| |main_#t~malloc45.base| 0) main_~node~1.base 0) |old(#valid)|) (= main_~node~1.base |main_#t~malloc45.base|))), 29062#(and (or (= main_~node~1.base main_~item~0.base) (= (store (store |#valid| main_~item~0.base 0) main_~node~1.base 0) |old(#valid)|)) (not (= 0 main_~item~0.base))), 29063#(and (not (= 0 main_~item~0.base)) (or (= (store (store |#valid| main_~item~0.base 0) (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset) 0) |old(#valid)|) (= main_~item~0.base (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset)))), 29064#(and (or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (store (store |#valid| main_~data~0.base 0) (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) 0) |old(#valid)|)) (not (= 0 main_~data~0.base))), 29065#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)), 29066#(and (or (= main_~data~0.base |main_#t~mem50.base|) (and (= (store (store |#valid| main_~data~0.base 0) |main_#t~mem50.base| 0) |old(#valid)|) (= |main_#t~mem50.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (not (= 0 main_~data~0.base))), 29067#(and (or (= main_~data~0.base main_~node~2.base) (= (store (store |#valid| main_~data~0.base 0) main_~node~2.base 0) |old(#valid)|)) (not (= 0 main_~data~0.base))), 29068#(or (= 0 (select |#valid| main_~node~2.base)) (= |old(#valid)| (store |#valid| main_~node~2.base 0))), 29069#(or (= 0 (select |#valid| main_~node~2.base)) (and (= |old(#valid)| (store |#valid| main_~node~2.base 0)) (or (not (= 0 main_~node~2.base)) (not (= 0 main_~node~2.offset))))), 29070#(and (= |old(#valid)| (store |#valid| main_~node~2.base 0)) (or (not (= 0 main_~node~2.base)) (not (= 0 main_~node~2.offset))) (= 1 (select |#valid| main_~node~2.base)))] [2018-02-02 20:42:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:10,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:42:10,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:42:10,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:42:10,418 INFO L87 Difference]: Start difference. First operand 526 states and 552 transitions. Second operand 15 states. [2018-02-02 20:42:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:11,666 INFO L93 Difference]: Finished difference Result 543 states and 569 transitions. [2018-02-02 20:42:11,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:42:11,666 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-02-02 20:42:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:11,667 INFO L225 Difference]: With dead ends: 543 [2018-02-02 20:42:11,667 INFO L226 Difference]: Without dead ends: 475 [2018-02-02 20:42:11,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:42:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-02-02 20:42:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 467. [2018-02-02 20:42:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-02-02 20:42:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 494 transitions. [2018-02-02 20:42:11,670 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 494 transitions. Word has length 93 [2018-02-02 20:42:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:11,671 INFO L432 AbstractCegarLoop]: Abstraction has 467 states and 494 transitions. [2018-02-02 20:42:11,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:42:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 494 transitions. [2018-02-02 20:42:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 20:42:11,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:11,671 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:11,671 INFO L371 AbstractCegarLoop]: === Iteration 37 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:11,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1650413227, now seen corresponding path program 1 times [2018-02-02 20:42:11,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:11,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:42:11,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:11,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:42:11,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:11,983 INFO L182 omatonBuilderFactory]: Interpolants [30112#(= 0 main_~data~0.offset), 30113#(and (or (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.offset 0)) (or (not (= inspect_before_~shape.offset 0)) (= inspect_before_~shape.base |inspect_before_#in~shape.base|))), 30114#(and (or (= inspect_before_~shape.offset 0) (not (= |inspect_before_#in~shape.offset| 0))) (or (not (= inspect_before_~shape.offset 0)) (= inspect_before_~shape.base |inspect_before_#in~shape.base|))), 30115#(or (not (= |inspect_before_#in~shape.offset| 0)) (= |inspect_before_#t~mem24.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ (- 0) 4)))), 30116#(or (not (= |inspect_before_#in~shape.offset| 0)) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ (- 0) 4)))), 30117#(or (and (= 1 (select |#valid| inspect_before_~shape.base)) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ (- 0) 4)))) (not (= |inspect_before_#in~shape.offset| 0))), 30118#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ (- 0) 4)))) (not (= |inspect_before_#in~shape.offset| 0))), 30119#(and (= 0 main_~data~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))))), 30120#(and (= 0 |seq_sort_core_#in~data.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |seq_sort_core_#in~data.base|) (+ 0 4))))), 30121#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4)))) (= seq_sort_core_~data.offset 0)), 30122#(and (= seq_sort_core_~data.offset 0) (= 1 (select |#valid| |seq_sort_core_#t~mem18.base|))), 30123#(and (= seq_sort_core_~data.offset 0) (= 1 (select |#valid| seq_sort_core_~next~0.base))), 30124#(= 1 (select |#valid| seq_sort_core_~next~0.base)), 30106#true, 30107#false, 30108#(= 0 |main_#t~malloc41.offset|), 30109#(= main_~node~1.offset 0), 30110#(= 0 |main_#t~malloc45.offset|), 30111#(= 0 main_~item~0.offset)] [2018-02-02 20:42:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:42:11,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:42:11,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:42:11,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:42:11,984 INFO L87 Difference]: Start difference. First operand 467 states and 494 transitions. Second operand 19 states. [2018-02-02 20:42:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:12,720 INFO L93 Difference]: Finished difference Result 479 states and 507 transitions. [2018-02-02 20:42:12,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:42:12,721 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 101 [2018-02-02 20:42:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:12,722 INFO L225 Difference]: With dead ends: 479 [2018-02-02 20:42:12,722 INFO L226 Difference]: Without dead ends: 479 [2018-02-02 20:42:12,722 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:42:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-02-02 20:42:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 467. [2018-02-02 20:42:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-02-02 20:42:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 495 transitions. [2018-02-02 20:42:12,725 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 495 transitions. Word has length 101 [2018-02-02 20:42:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:12,725 INFO L432 AbstractCegarLoop]: Abstraction has 467 states and 495 transitions. [2018-02-02 20:42:12,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:42:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 495 transitions. [2018-02-02 20:42:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 20:42:12,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:12,726 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:12,726 INFO L371 AbstractCegarLoop]: === Iteration 38 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:12,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1650413228, now seen corresponding path program 1 times [2018-02-02 20:42:12,726 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:12,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:13,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:13,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:42:13,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:13,400 INFO L182 omatonBuilderFactory]: Interpolants [31104#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))), 31105#(and (or (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.offset 0)) (or (not (= inspect_before_~shape.offset 0)) (= inspect_before_~shape.base |inspect_before_#in~shape.base|))), 31106#(and (or (= inspect_before_~shape.offset 0) (not (= |inspect_before_#in~shape.offset| 0))) (or (not (= inspect_before_~shape.offset 0)) (= inspect_before_~shape.base |inspect_before_#in~shape.base|))), 31107#(and (or (= inspect_before_~shape.offset 0) (not (= |inspect_before_#in~shape.offset| 0))) (or (and (= inspect_before_~shape.base |inspect_before_#in~shape.base|) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.offset|)) (not (= inspect_before_~shape.offset 0)))), 31108#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ (- 0) 4)))) (not (= |inspect_before_#in~shape.offset| 0)) (and (= |inspect_before_#t~mem24.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ (- 0) 4))) (= |inspect_before_#t~mem24.offset| 0))), 31109#(or (and (= inspect_before_~shape.offset 0) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ (- 0) 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ (- 0) 4)))) (not (= |inspect_before_#in~shape.offset| 0))), 31110#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |seq_sort_core_#in~data.base|) (+ 0 4)))) (= 0 |seq_sort_core_#in~data.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |seq_sort_core_#in~data.base|) (+ 0 4)))), 31111#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4))) (= seq_sort_core_~data.offset 0)), 31112#(and (= 0 |seq_sort_core_#t~mem18.offset|) (= seq_sort_core_~data.offset 0) (= 8 (select |#length| |seq_sort_core_#t~mem18.base|))), 31113#(and (= 8 (select |#length| seq_sort_core_~next~0.base)) (= seq_sort_core_~data.offset 0) (= seq_sort_core_~next~0.offset 0)), 31114#(and (= 8 (select |#length| seq_sort_core_~next~0.base)) (= seq_sort_core_~next~0.offset 0)), 31092#true, 31093#false, 31094#(= 0 |main_#t~malloc41.offset|), 31095#(= main_~node~1.offset 0), 31096#(and (= 0 |main_#t~malloc45.offset|) (= 8 (select |#length| |main_#t~malloc45.base|)) (= main_~node~1.offset 0)), 31097#(and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~item~0.offset) (= main_~node~1.offset 0)), 31098#(and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~item~0.offset) (= 1 (select |#valid| main_~item~0.base))), 31099#(and (= 8 (select |#length| main_~data~0.base)) (= 1 (select |#valid| main_~data~0.base)) (= 0 main_~data~0.offset)), 31100#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset)), 31101#(and (= 8 (select |#length| main_~data~0.base)) (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset)), 31102#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset) (= main_~item~0.offset 0)), 31103#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ 0 4)))) (= main_~item~0.offset 0))] [2018-02-02 20:42:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:13,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:42:13,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:42:13,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:42:13,401 INFO L87 Difference]: Start difference. First operand 467 states and 495 transitions. Second operand 23 states. [2018-02-02 20:42:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:14,502 INFO L93 Difference]: Finished difference Result 489 states and 517 transitions. [2018-02-02 20:42:14,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:42:14,502 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 101 [2018-02-02 20:42:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:14,503 INFO L225 Difference]: With dead ends: 489 [2018-02-02 20:42:14,503 INFO L226 Difference]: Without dead ends: 489 [2018-02-02 20:42:14,504 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:42:14,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-02-02 20:42:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 467. [2018-02-02 20:42:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-02-02 20:42:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 494 transitions. [2018-02-02 20:42:14,507 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 494 transitions. Word has length 101 [2018-02-02 20:42:14,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:14,507 INFO L432 AbstractCegarLoop]: Abstraction has 467 states and 494 transitions. [2018-02-02 20:42:14,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:42:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 494 transitions. [2018-02-02 20:42:14,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 20:42:14,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:14,508 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:14,508 INFO L371 AbstractCegarLoop]: === Iteration 39 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:14,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1101824494, now seen corresponding path program 1 times [2018-02-02 20:42:14,509 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:14,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 20:42:14,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:42:14,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:42:14,564 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:14,565 INFO L182 omatonBuilderFactory]: Interpolants [32103#true, 32104#false, 32105#(not (= 0 |main_#t~malloc45.base|)), 32106#(not (= 0 main_~item~0.base)), 32107#(not (= 0 main_~data~0.base)), 32108#(= |seq_sort_core_#in~data.base| seq_sort_core_~data.base), 32109#(= 0 |seq_sort_core_#in~data.base|)] [2018-02-02 20:42:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 20:42:14,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:42:14,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:42:14,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:42:14,565 INFO L87 Difference]: Start difference. First operand 467 states and 494 transitions. Second operand 7 states. [2018-02-02 20:42:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:14,634 INFO L93 Difference]: Finished difference Result 503 states and 528 transitions. [2018-02-02 20:42:14,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:42:14,634 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-02-02 20:42:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:14,635 INFO L225 Difference]: With dead ends: 503 [2018-02-02 20:42:14,635 INFO L226 Difference]: Without dead ends: 500 [2018-02-02 20:42:14,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:42:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-02-02 20:42:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 467. [2018-02-02 20:42:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-02-02 20:42:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 493 transitions. [2018-02-02 20:42:14,638 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 493 transitions. Word has length 102 [2018-02-02 20:42:14,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:14,638 INFO L432 AbstractCegarLoop]: Abstraction has 467 states and 493 transitions. [2018-02-02 20:42:14,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:42:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 493 transitions. [2018-02-02 20:42:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-02 20:42:14,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:14,639 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:14,639 INFO L371 AbstractCegarLoop]: === Iteration 40 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:14,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1324593485, now seen corresponding path program 1 times [2018-02-02 20:42:14,639 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:14,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:14,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:42:14,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:42:14,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:14,661 INFO L182 omatonBuilderFactory]: Interpolants [33088#true, 33089#false, 33090#(= 1 (select |#valid| |merge_pair_~#dst.base|))] [2018-02-02 20:42:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:14,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:42:14,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:42:14,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:42:14,662 INFO L87 Difference]: Start difference. First operand 467 states and 493 transitions. Second operand 3 states. [2018-02-02 20:42:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:14,765 INFO L93 Difference]: Finished difference Result 463 states and 489 transitions. [2018-02-02 20:42:14,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:42:14,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-02-02 20:42:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:14,767 INFO L225 Difference]: With dead ends: 463 [2018-02-02 20:42:14,767 INFO L226 Difference]: Without dead ends: 463 [2018-02-02 20:42:14,768 INFO L554 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-02-02 20:42:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-02 20:42:14,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2018-02-02 20:42:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-02-02 20:42:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 489 transitions. [2018-02-02 20:42:14,772 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 489 transitions. Word has length 104 [2018-02-02 20:42:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:14,772 INFO L432 AbstractCegarLoop]: Abstraction has 463 states and 489 transitions. [2018-02-02 20:42:14,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:42:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 489 transitions. [2018-02-02 20:42:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-02 20:42:14,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:14,773 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:14,774 INFO L371 AbstractCegarLoop]: === Iteration 41 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:14,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1324593484, now seen corresponding path program 1 times [2018-02-02 20:42:14,774 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:14,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:14,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:42:14,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:42:14,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:14,824 INFO L182 omatonBuilderFactory]: Interpolants [34017#true, 34018#false, 34019#(and (= (select |#length| |merge_pair_~#dst.base|) 4) (= |merge_pair_~#dst.offset| 0))] [2018-02-02 20:42:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:14,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:42:14,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:42:14,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:42:14,825 INFO L87 Difference]: Start difference. First operand 463 states and 489 transitions. Second operand 3 states. [2018-02-02 20:42:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:14,901 INFO L93 Difference]: Finished difference Result 459 states and 485 transitions. [2018-02-02 20:42:14,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:42:14,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-02-02 20:42:14,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:14,909 INFO L225 Difference]: With dead ends: 459 [2018-02-02 20:42:14,909 INFO L226 Difference]: Without dead ends: 459 [2018-02-02 20:42:14,909 INFO L554 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-02-02 20:42:14,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-02 20:42:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2018-02-02 20:42:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-02-02 20:42:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 485 transitions. [2018-02-02 20:42:14,914 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 485 transitions. Word has length 104 [2018-02-02 20:42:14,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:14,914 INFO L432 AbstractCegarLoop]: Abstraction has 459 states and 485 transitions. [2018-02-02 20:42:14,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:42:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 485 transitions. [2018-02-02 20:42:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 20:42:14,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:14,915 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:14,916 INFO L371 AbstractCegarLoop]: === Iteration 42 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:14,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1595111753, now seen corresponding path program 1 times [2018-02-02 20:42:14,916 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:14,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:14,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:42:14,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:42:14,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:14,964 INFO L182 omatonBuilderFactory]: Interpolants [34938#true, 34939#false, 34940#(= 1 (select |#valid| |merge_pair_~#sub1.base|)), 34941#(or (= |merge_pair_~#sub1.base| |merge_pair_~#dst.base|) (= (select |#valid| |merge_pair_~#sub1.base|) 1))] [2018-02-02 20:42:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:14,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:42:14,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:42:14,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:42:14,965 INFO L87 Difference]: Start difference. First operand 459 states and 485 transitions. Second operand 4 states. [2018-02-02 20:42:15,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:15,071 INFO L93 Difference]: Finished difference Result 454 states and 480 transitions. [2018-02-02 20:42:15,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:42:15,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-02-02 20:42:15,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:15,072 INFO L225 Difference]: With dead ends: 454 [2018-02-02 20:42:15,072 INFO L226 Difference]: Without dead ends: 454 [2018-02-02 20:42:15,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:42:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-02-02 20:42:15,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2018-02-02 20:42:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-02-02 20:42:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 480 transitions. [2018-02-02 20:42:15,075 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 480 transitions. Word has length 108 [2018-02-02 20:42:15,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:15,076 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 480 transitions. [2018-02-02 20:42:15,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:42:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 480 transitions. [2018-02-02 20:42:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 20:42:15,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:15,076 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:15,076 INFO L371 AbstractCegarLoop]: === Iteration 43 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:15,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1595111752, now seen corresponding path program 1 times [2018-02-02 20:42:15,077 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:15,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:15,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:42:15,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:42:15,111 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:15,111 INFO L182 omatonBuilderFactory]: Interpolants [35850#true, 35851#false, 35852#(and (= |merge_pair_~#sub1.offset| 0) (= 4 (select |#length| |merge_pair_~#sub1.base|)))] [2018-02-02 20:42:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:15,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:42:15,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:42:15,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:42:15,112 INFO L87 Difference]: Start difference. First operand 454 states and 480 transitions. Second operand 3 states. [2018-02-02 20:42:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:15,194 INFO L93 Difference]: Finished difference Result 449 states and 475 transitions. [2018-02-02 20:42:15,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:42:15,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-02-02 20:42:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:15,195 INFO L225 Difference]: With dead ends: 449 [2018-02-02 20:42:15,195 INFO L226 Difference]: Without dead ends: 449 [2018-02-02 20:42:15,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:42:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-02 20:42:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-02-02 20:42:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-02-02 20:42:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 475 transitions. [2018-02-02 20:42:15,198 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 475 transitions. Word has length 108 [2018-02-02 20:42:15,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:15,199 INFO L432 AbstractCegarLoop]: Abstraction has 449 states and 475 transitions. [2018-02-02 20:42:15,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:42:15,199 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 475 transitions. [2018-02-02 20:42:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 20:42:15,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:15,199 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:15,199 INFO L371 AbstractCegarLoop]: === Iteration 44 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:15,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2144112081, now seen corresponding path program 1 times [2018-02-02 20:42:15,200 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:15,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:15,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:42:15,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:42:15,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:15,233 INFO L182 omatonBuilderFactory]: Interpolants [36752#false, 36753#(= 1 (select |#valid| seq_sort_core_~data.base)), 36754#(= 1 (select |#valid| seq_sort_core_~dst~0.base)), 36755#(= 1 (select |#valid| |seq_sort_core_#res.base|)), 36756#(= 1 (select |#valid| |main_#t~ret48.base|)), 36757#(= 1 (select |#valid| main_~data~0.base)), 36751#true] [2018-02-02 20:42:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:15,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:42:15,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:42:15,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:42:15,233 INFO L87 Difference]: Start difference. First operand 449 states and 475 transitions. Second operand 7 states. [2018-02-02 20:42:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:15,458 INFO L93 Difference]: Finished difference Result 459 states and 486 transitions. [2018-02-02 20:42:15,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:42:15,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-02-02 20:42:15,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:15,459 INFO L225 Difference]: With dead ends: 459 [2018-02-02 20:42:15,459 INFO L226 Difference]: Without dead ends: 459 [2018-02-02 20:42:15,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:42:15,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-02 20:42:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 458. [2018-02-02 20:42:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-02-02 20:42:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 486 transitions. [2018-02-02 20:42:15,463 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 486 transitions. Word has length 107 [2018-02-02 20:42:15,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:15,463 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 486 transitions. [2018-02-02 20:42:15,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:42:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 486 transitions. [2018-02-02 20:42:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 20:42:15,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:15,464 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:15,464 INFO L371 AbstractCegarLoop]: === Iteration 45 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:15,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2144112082, now seen corresponding path program 1 times [2018-02-02 20:42:15,465 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:15,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 20:42:15,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:42:15,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:42:15,605 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:15,606 INFO L182 omatonBuilderFactory]: Interpolants [37680#false, 37681#(and (= 0 |main_#t~malloc45.offset|) (= 8 (select |#length| |main_#t~malloc45.base|))), 37682#(and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~item~0.offset)), 37683#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset)), 37684#(= |old(#length)| |#length|), 37685#(and (= |seq_sort_core_#in~data.offset| seq_sort_core_~data.offset) (= |seq_sort_core_#in~data.base| seq_sort_core_~data.base) (= |old(#length)| |#length|)), 37686#(and (= |seq_sort_core_#in~data.base| seq_sort_core_~dst~0.base) (= |seq_sort_core_#in~data.offset| seq_sort_core_~dst~0.offset) (= |old(#length)| |#length|)), 37687#(and (= |seq_sort_core_#in~data.base| |seq_sort_core_#res.base|) (= |old(#length)| |#length|) (= |seq_sort_core_#in~data.offset| |seq_sort_core_#res.offset|)), 37688#(and (= 0 |main_#t~ret48.offset|) (= 8 (select |#length| |main_#t~ret48.base|))), 37679#true] [2018-02-02 20:42:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 20:42:15,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:42:15,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:42:15,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:42:15,606 INFO L87 Difference]: Start difference. First operand 458 states and 486 transitions. Second operand 10 states. [2018-02-02 20:42:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:16,111 INFO L93 Difference]: Finished difference Result 516 states and 556 transitions. [2018-02-02 20:42:16,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:42:16,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2018-02-02 20:42:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:16,113 INFO L225 Difference]: With dead ends: 516 [2018-02-02 20:42:16,113 INFO L226 Difference]: Without dead ends: 516 [2018-02-02 20:42:16,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:42:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-02-02 20:42:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 467. [2018-02-02 20:42:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-02-02 20:42:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 501 transitions. [2018-02-02 20:42:16,117 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 501 transitions. Word has length 107 [2018-02-02 20:42:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:16,117 INFO L432 AbstractCegarLoop]: Abstraction has 467 states and 501 transitions. [2018-02-02 20:42:16,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:42:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 501 transitions. [2018-02-02 20:42:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 20:42:16,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:16,118 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:16,118 INFO L371 AbstractCegarLoop]: === Iteration 46 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:16,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1800760581, now seen corresponding path program 4 times [2018-02-02 20:42:16,119 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:16,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 17 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:17,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:17,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:42:17,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:17,234 INFO L182 omatonBuilderFactory]: Interpolants [38684#true, 38685#false, 38686#(= 0 |main_#t~malloc41.offset|), 38687#(= main_~node~1.offset 0), 38688#(and (= 1 (select |#valid| |main_#t~malloc45.base|)) (= main_~node~1.offset 0)), 38689#(and (= 1 (select |#valid| main_~item~0.base)) (= main_~node~1.offset 0)), 38690#(= 1 (select |#valid| main_~item~0.base)), 38691#(= 1 (select |#valid| main_~data~0.base)), 38692#(and (or (= 1 (select |#valid| main_~data~0.base)) (= |main_#t~malloc45.base| main_~data~0.base)) (= 0 |main_#t~malloc45.offset|)), 38693#(and (or (= main_~item~0.base main_~data~0.base) (= 1 (select |#valid| main_~data~0.base))) (= main_~item~0.offset 0)), 38694#(and (= 1 (select |#valid| main_~data~0.base)) (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset 0)), 38695#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4)))) (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset 0)), 38696#(and (= 1 (select |#valid| main_~data~0.base)) (= 0 main_~data~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))))), 38697#(and (or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (= |main_#t~malloc41.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (not (= main_~data~0.base |main_#t~malloc41.base|)) (= 0 main_~data~0.offset)), 38698#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4)))) (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4)))) (not (= main_~node~1.base main_~data~0.base)) (= 0 main_~data~0.offset)), 38699#(and (or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (= main_~node~1.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (= 0 main_~data~0.offset)), 38700#(and (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset) (or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (= |main_#t~malloc45.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (= main_~node~1.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))))), 38701#(and (or (= main_~item~0.base main_~data~0.base) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4)))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4))) (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4))) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4)))) (= 0 main_~data~0.offset) (= main_~item~0.offset 0)), 38702#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4)))) (= (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4))) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4)))) (= 0 main_~data~0.offset) (= main_~item~0.offset 0)), 38703#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4)))) (= (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) (= (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4)))) (= main_~item~0.offset 0)), 38704#(and (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (or (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4)))) (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))))), 38705#(and (= 0 |inspect_before_#in~shape.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ 0 4))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4)))) (= (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4))) (= (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4))))), 38706#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (or (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))))), 38707#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (or (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))) (= |inspect_before_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))), 38708#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (or (= |inspect_before_#t~mem27.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))))), 38709#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))))), 38710#(and (= 0 |inspect_before_#t~mem24.offset|) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) (+ 0 4)))) (= |inspect_before_#t~mem24.base| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) (+ 0 4))))), 38711#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= inspect_before_~shape.offset 0)), 38712#(and (= inspect_before_~shape.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 1 (select |#valid| inspect_before_~shape.base))), 38713#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 1 inspect_before_~shape.offset))) (<= (+ inspect_before_~shape.offset 1) 0)) (= 1 (select |#valid| inspect_before_~shape.base))), 38714#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 1 inspect_before_~shape.offset))), 38715#(= 1 (select |#valid| |inspect_before_#t~mem24.base|)), 38716#(= 1 (select |#valid| inspect_before_~shape.base))] [2018-02-02 20:42:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 17 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:17,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:42:17,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:42:17,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:42:17,235 INFO L87 Difference]: Start difference. First operand 467 states and 501 transitions. Second operand 33 states. [2018-02-02 20:42:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:19,661 INFO L93 Difference]: Finished difference Result 495 states and 534 transitions. [2018-02-02 20:42:19,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:42:19,661 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 107 [2018-02-02 20:42:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:19,662 INFO L225 Difference]: With dead ends: 495 [2018-02-02 20:42:19,662 INFO L226 Difference]: Without dead ends: 495 [2018-02-02 20:42:19,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=536, Invalid=3124, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 20:42:19,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-02-02 20:42:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 470. [2018-02-02 20:42:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-02-02 20:42:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 505 transitions. [2018-02-02 20:42:19,666 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 505 transitions. Word has length 107 [2018-02-02 20:42:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:19,666 INFO L432 AbstractCegarLoop]: Abstraction has 470 states and 505 transitions. [2018-02-02 20:42:19,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:42:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 505 transitions. [2018-02-02 20:42:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 20:42:19,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:19,667 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:19,667 INFO L371 AbstractCegarLoop]: === Iteration 47 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1800760580, now seen corresponding path program 2 times [2018-02-02 20:42:19,668 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:19,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:20,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:20,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 20:42:20,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:20,826 INFO L182 omatonBuilderFactory]: Interpolants [39744#(= main_~node~1.offset 0), 39745#(and (= 0 |main_#t~malloc45.offset|) (= 8 (select |#length| |main_#t~malloc45.base|)) (= main_~node~1.offset 0)), 39746#(and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~item~0.offset) (= main_~node~1.offset 0)), 39747#(and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~item~0.offset) (= 1 (select |#valid| main_~item~0.base))), 39748#(and (= 8 (select |#length| main_~data~0.base)) (= 1 (select |#valid| main_~data~0.base)) (= 0 main_~data~0.offset)), 39749#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset)), 39750#(and (= 8 (select |#length| main_~data~0.base)) (= 1 (select |#valid| |main_#t~malloc45.base|)) (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset)), 39751#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset) (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset 0)), 39752#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset 0)), 39753#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (= 1 (select |#valid| main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))), 39754#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (= 1 (select |#valid| main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc41.base|)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))), 39755#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4)))) (not (= main_~node~1.base main_~data~0.base)) (= 1 (select |#valid| main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~node~1.base (store (select |#memory_$Pointer$.offset| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))) (= 0 main_~data~0.offset)), 39756#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (not (= main_~node~1.base main_~data~0.base)) (= 1 (select |#valid| main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (= (select |#valid| main_~node~1.base) 1)), 39757#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (= 1 (select |#valid| main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (= (select |#valid| main_~node~1.base) 1)), 39758#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (not (= main_~data~0.base |main_#t~malloc45.base|)) (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (not (= main_~node~1.base |main_#t~malloc45.base|))), 39759#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset main_~node~1.offset)) main_~data~0.base) (+ 0 4))) (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (= main_~item~0.offset 0)), 39760#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset)) main_~data~0.base) (+ 0 4))) (= 0 main_~data~0.offset) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4)))) (= main_~item~0.offset 0)), 39761#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4)))) (= main_~item~0.offset 0)), 39762#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))))), 39763#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4)))) (= 0 |inspect_before_#in~shape.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4)))), 39764#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))), 39765#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= |inspect_before_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))), 39766#(and (= 0 |inspect_before_#t~mem24.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#t~mem24.base|) (+ 0 4)))), 39767#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))), 39768#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (<= (+ inspect_before_~shape.offset 1) 0)) (not (= 1 inspect_before_~shape.offset))), 39769#(and (or (and (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (<= (+ inspect_before_~shape.offset 1) 0)) (not (= 1 inspect_before_~shape.offset))), 39770#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 1 inspect_before_~shape.offset))), 39771#(and (= 0 |inspect_before_#t~mem24.offset|) (= 8 (select |#length| |inspect_before_#t~mem24.base|))), 39772#(and (= (select |#length| inspect_before_~shape.base) 8) (= inspect_before_~shape.offset 0)), 39741#true, 39742#false, 39743#(= 0 |main_#t~malloc41.offset|)] [2018-02-02 20:42:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:20,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:42:20,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:42:20,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=914, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:42:20,827 INFO L87 Difference]: Start difference. First operand 470 states and 505 transitions. Second operand 32 states. [2018-02-02 20:42:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:23,502 INFO L93 Difference]: Finished difference Result 555 states and 595 transitions. [2018-02-02 20:42:23,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:42:23,502 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 107 [2018-02-02 20:42:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:23,503 INFO L225 Difference]: With dead ends: 555 [2018-02-02 20:42:23,503 INFO L226 Difference]: Without dead ends: 555 [2018-02-02 20:42:23,504 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=590, Invalid=3070, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 20:42:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-02-02 20:42:23,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 501. [2018-02-02 20:42:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-02-02 20:42:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 538 transitions. [2018-02-02 20:42:23,507 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 538 transitions. Word has length 107 [2018-02-02 20:42:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:23,507 INFO L432 AbstractCegarLoop]: Abstraction has 501 states and 538 transitions. [2018-02-02 20:42:23,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 20:42:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 538 transitions. [2018-02-02 20:42:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 20:42:23,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:23,508 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:23,508 INFO L371 AbstractCegarLoop]: === Iteration 48 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:23,508 INFO L82 PathProgramCache]: Analyzing trace with hash 289782419, now seen corresponding path program 1 times [2018-02-02 20:42:23,509 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:23,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:42:23,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:23,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:42:23,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:23,577 INFO L182 omatonBuilderFactory]: Interpolants [40896#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 40897#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|))), 40898#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_after_~shape.base) inspect_after_~shape.offset))), 40899#(= 1 (select |#valid| |inspect_after_#t~mem36.base|)), 40900#(= 1 (select |#valid| inspect_after_~pos~0.base)), 40890#true, 40891#false, 40892#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)), 40893#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|) (= |inspect_before_#t~mem27.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))), 40894#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))), 40895#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))] [2018-02-02 20:42:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:42:23,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:42:23,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:42:23,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:42:23,577 INFO L87 Difference]: Start difference. First operand 501 states and 538 transitions. Second operand 11 states. [2018-02-02 20:42:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:23,861 INFO L93 Difference]: Finished difference Result 508 states and 541 transitions. [2018-02-02 20:42:23,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:42:23,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 110 [2018-02-02 20:42:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:23,862 INFO L225 Difference]: With dead ends: 508 [2018-02-02 20:42:23,862 INFO L226 Difference]: Without dead ends: 508 [2018-02-02 20:42:23,863 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:42:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-02-02 20:42:23,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 503. [2018-02-02 20:42:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-02-02 20:42:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 541 transitions. [2018-02-02 20:42:23,868 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 541 transitions. Word has length 110 [2018-02-02 20:42:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:23,868 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 541 transitions. [2018-02-02 20:42:23,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:42:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 541 transitions. [2018-02-02 20:42:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 20:42:23,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:23,869 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:23,869 INFO L371 AbstractCegarLoop]: === Iteration 49 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:23,870 INFO L82 PathProgramCache]: Analyzing trace with hash 289782420, now seen corresponding path program 1 times [2018-02-02 20:42:23,870 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:23,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:42:24,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:24,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:42:24,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:24,081 INFO L182 omatonBuilderFactory]: Interpolants [41920#true, 41921#false, 41922#(= 0 |main_#t~malloc41.offset|), 41923#(= 0 main_~node~1.offset), 41924#(= 0 (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset)), 41925#(= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)), 41926#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)), 41927#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|) (= |inspect_before_#t~mem27.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))), 41928#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)), 41929#(<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))), 41930#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 41931#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|))), 41932#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| inspect_after_~shape.base) inspect_after_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_after_~shape.base) inspect_after_~shape.offset))), 41933#(and (<= 4 (select |#length| |inspect_after_#t~mem36.base|)) (= 0 |inspect_after_#t~mem36.offset|)), 41934#(and (= inspect_after_~pos~0.offset 0) (<= 4 (select |#length| inspect_after_~pos~0.base)))] [2018-02-02 20:42:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:42:24,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:42:24,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:42:24,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:42:24,081 INFO L87 Difference]: Start difference. First operand 503 states and 541 transitions. Second operand 15 states. [2018-02-02 20:42:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:24,518 INFO L93 Difference]: Finished difference Result 528 states and 562 transitions. [2018-02-02 20:42:24,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:42:24,518 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 110 [2018-02-02 20:42:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:24,519 INFO L225 Difference]: With dead ends: 528 [2018-02-02 20:42:24,519 INFO L226 Difference]: Without dead ends: 528 [2018-02-02 20:42:24,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:42:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-02-02 20:42:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 507. [2018-02-02 20:42:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-02-02 20:42:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 545 transitions. [2018-02-02 20:42:24,524 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 545 transitions. Word has length 110 [2018-02-02 20:42:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:24,524 INFO L432 AbstractCegarLoop]: Abstraction has 507 states and 545 transitions. [2018-02-02 20:42:24,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:42:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 545 transitions. [2018-02-02 20:42:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-02 20:42:24,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:24,525 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:24,525 INFO L371 AbstractCegarLoop]: === Iteration 50 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1347778353, now seen corresponding path program 1 times [2018-02-02 20:42:24,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:24,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:42:24,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:24,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:42:24,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:24,665 INFO L182 omatonBuilderFactory]: Interpolants [42992#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset)), 42993#(= |old(#length)| |#length|), 42994#(and (= |seq_sort_core_#in~data.base| seq_sort_core_~data.base) (= seq_sort_core_~data.offset |seq_sort_core_#in~data.offset|) (= |old(#length)| |#length|)), 42995#(and (= |seq_sort_core_#in~data.base| seq_sort_core_~dst~0.base) (= seq_sort_core_~dst~0.offset |seq_sort_core_#in~data.offset|) (= |old(#length)| |#length|)), 42996#(and (= |seq_sort_core_#res.offset| |seq_sort_core_#in~data.offset|) (= |seq_sort_core_#in~data.base| |seq_sort_core_#res.base|) (= |old(#length)| |#length|)), 42997#(and (= 0 |main_#t~ret48.offset|) (= 8 (select |#length| |main_#t~ret48.base|))), 42998#(and (= 0 |seq_sort_core_#in~data.offset|) (= 8 (select |#length| |seq_sort_core_#in~data.base|))), 42999#(and (= seq_sort_core_~data.offset 0) (= (select |#length| seq_sort_core_~data.base) 8)), 42988#true, 42989#false, 42990#(and (= 0 |main_#t~malloc45.offset|) (= 8 (select |#length| |main_#t~malloc45.base|))), 42991#(and (= 8 (select |#length| main_~item~0.base)) (= 0 main_~item~0.offset))] [2018-02-02 20:42:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:42:24,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:42:24,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:42:24,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:42:24,666 INFO L87 Difference]: Start difference. First operand 507 states and 545 transitions. Second operand 12 states. [2018-02-02 20:42:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:25,301 INFO L93 Difference]: Finished difference Result 575 states and 620 transitions. [2018-02-02 20:42:25,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:42:25,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2018-02-02 20:42:25,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:25,303 INFO L225 Difference]: With dead ends: 575 [2018-02-02 20:42:25,303 INFO L226 Difference]: Without dead ends: 575 [2018-02-02 20:42:25,303 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:42:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-02-02 20:42:25,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 522. [2018-02-02 20:42:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-02-02 20:42:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 560 transitions. [2018-02-02 20:42:25,307 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 560 transitions. Word has length 113 [2018-02-02 20:42:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:25,307 INFO L432 AbstractCegarLoop]: Abstraction has 522 states and 560 transitions. [2018-02-02 20:42:25,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:42:25,307 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 560 transitions. [2018-02-02 20:42:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-02-02 20:42:25,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:25,308 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:25,308 INFO L371 AbstractCegarLoop]: === Iteration 51 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:25,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2125874551, now seen corresponding path program 1 times [2018-02-02 20:42:25,308 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:25,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 20:42:25,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:42:25,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:42:25,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:25,387 INFO L182 omatonBuilderFactory]: Interpolants [44128#(and (<= 8 (select |#length| inspect_after_~shape.base)) (= inspect_after_~shape.offset 0)), 44117#true, 44118#false, 44119#(= 0 |main_#t~malloc45.offset|), 44120#(= 0 main_~item~0.offset), 44121#(= 0 main_~data~0.offset), 44122#(= |seq_sort_core_#in~data.offset| seq_sort_core_~data.offset), 44123#(= |seq_sort_core_#in~data.offset| seq_sort_core_~dst~0.offset), 44124#(= |seq_sort_core_#in~data.offset| |seq_sort_core_#res.offset|), 44125#(= 0 |main_#t~ret48.offset|), 44126#(and (<= (+ main_~data~0.offset 8) (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset)), 44127#(and (<= 8 (select |#length| |inspect_after_#in~shape.base|)) (= 0 |inspect_after_#in~shape.offset|))] [2018-02-02 20:42:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 20:42:25,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:42:25,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:42:25,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:42:25,388 INFO L87 Difference]: Start difference. First operand 522 states and 560 transitions. Second operand 12 states. [2018-02-02 20:42:25,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:25,691 INFO L93 Difference]: Finished difference Result 623 states and 673 transitions. [2018-02-02 20:42:25,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:42:25,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 115 [2018-02-02 20:42:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:25,693 INFO L225 Difference]: With dead ends: 623 [2018-02-02 20:42:25,693 INFO L226 Difference]: Without dead ends: 623 [2018-02-02 20:42:25,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:42:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-02-02 20:42:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 570. [2018-02-02 20:42:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-02-02 20:42:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 633 transitions. [2018-02-02 20:42:25,701 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 633 transitions. Word has length 115 [2018-02-02 20:42:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:25,701 INFO L432 AbstractCegarLoop]: Abstraction has 570 states and 633 transitions. [2018-02-02 20:42:25,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:42:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 633 transitions. [2018-02-02 20:42:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-02-02 20:42:25,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:25,702 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:25,704 INFO L371 AbstractCegarLoop]: === Iteration 52 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:25,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1788602816, now seen corresponding path program 1 times [2018-02-02 20:42:25,704 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:25,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:42:25,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:25,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:42:25,834 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:25,834 INFO L182 omatonBuilderFactory]: Interpolants [45344#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= |inspect_before_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (= inspect_before_~shape.base |inspect_before_#in~shape.base|) (= |inspect_before_#t~mem27.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))), 45345#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|) (= |inspect_before_#t~mem28.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset))) (= |inspect_before_#t~mem28.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)))), 45346#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset))) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)), 45347#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))), 45348#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 45349#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|)) (select (select |#memory_$Pointer$.offset| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|)))), 45350#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_after_~shape.base) inspect_after_~shape.offset)) (select (select |#memory_$Pointer$.offset| inspect_after_~shape.base) inspect_after_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_after_~shape.base) inspect_after_~shape.offset)) (select (select |#memory_$Pointer$.offset| inspect_after_~shape.base) inspect_after_~shape.offset)))), 45351#(and (= 0 (select (select |#memory_$Pointer$.offset| |inspect_after_#t~mem36.base|) |inspect_after_#t~mem36.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |inspect_after_#t~mem36.base|) |inspect_after_#t~mem36.offset|))), 45352#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_after_~pos~0.base) inspect_after_~pos~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| inspect_after_~pos~0.base) inspect_after_~pos~0.offset))), 45353#(and (= |inspect_after_#t~mem38.offset| 0) (= |inspect_after_#t~mem38.base| 0)), 45341#true, 45342#false, 45343#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|))] [2018-02-02 20:42:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:42:25,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:42:25,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:42:25,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:42:25,835 INFO L87 Difference]: Start difference. First operand 570 states and 633 transitions. Second operand 13 states. [2018-02-02 20:42:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:26,255 INFO L93 Difference]: Finished difference Result 574 states and 631 transitions. [2018-02-02 20:42:26,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:42:26,256 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-02-02 20:42:26,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:26,257 INFO L225 Difference]: With dead ends: 574 [2018-02-02 20:42:26,257 INFO L226 Difference]: Without dead ends: 574 [2018-02-02 20:42:26,257 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:42:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-02-02 20:42:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 562. [2018-02-02 20:42:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-02-02 20:42:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 619 transitions. [2018-02-02 20:42:26,263 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 619 transitions. Word has length 115 [2018-02-02 20:42:26,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:26,263 INFO L432 AbstractCegarLoop]: Abstraction has 562 states and 619 transitions. [2018-02-02 20:42:26,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:42:26,264 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 619 transitions. [2018-02-02 20:42:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-02 20:42:26,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:26,264 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:26,264 INFO L371 AbstractCegarLoop]: === Iteration 53 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:26,265 INFO L82 PathProgramCache]: Analyzing trace with hash 62678655, now seen corresponding path program 1 times [2018-02-02 20:42:26,265 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:26,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:26,319 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:42:26,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:42:26,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:26,320 INFO L182 omatonBuilderFactory]: Interpolants [46500#true, 46501#false, 46502#(= (select |#valid| |merge_pair_~#sub2.base|) 1), 46503#(and (= 1 (select |#valid| |merge_pair_~#sub2.base|)) (not (= |merge_pair_~#sub2.base| |merge_pair_~#dst.base|))), 46504#(or (= 1 (select |#valid| |merge_pair_~#sub2.base|)) (= |merge_pair_~#sub2.base| |merge_pair_~#sub1.base|)), 46505#(or (= |merge_pair_~#sub2.base| |merge_pair_~#dst.base|) (= |merge_pair_~#sub2.base| |merge_pair_~#sub1.base|) (= (select |#valid| |merge_pair_~#sub2.base|) 1))] [2018-02-02 20:42:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:26,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:42:26,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:42:26,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:42:26,320 INFO L87 Difference]: Start difference. First operand 562 states and 619 transitions. Second operand 6 states. [2018-02-02 20:42:26,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:26,425 INFO L93 Difference]: Finished difference Result 558 states and 615 transitions. [2018-02-02 20:42:26,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:42:26,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2018-02-02 20:42:26,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:26,426 INFO L225 Difference]: With dead ends: 558 [2018-02-02 20:42:26,426 INFO L226 Difference]: Without dead ends: 558 [2018-02-02 20:42:26,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:42:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-02-02 20:42:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2018-02-02 20:42:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-02-02 20:42:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 615 transitions. [2018-02-02 20:42:26,432 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 615 transitions. Word has length 116 [2018-02-02 20:42:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:26,432 INFO L432 AbstractCegarLoop]: Abstraction has 558 states and 615 transitions. [2018-02-02 20:42:26,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:42:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 615 transitions. [2018-02-02 20:42:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-02 20:42:26,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:26,433 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:26,433 INFO L371 AbstractCegarLoop]: === Iteration 54 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:26,433 INFO L82 PathProgramCache]: Analyzing trace with hash 62678656, now seen corresponding path program 1 times [2018-02-02 20:42:26,434 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:26,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:26,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:42:26,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:42:26,498 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:26,499 INFO L182 omatonBuilderFactory]: Interpolants [47622#true, 47623#false, 47624#(and (= |merge_pair_~#sub2.offset| 0) (= 4 (select |#length| |merge_pair_~#sub2.base|)) (= (select |#valid| |merge_pair_~#sub2.base|) 1)), 47625#(and (= |merge_pair_~#sub2.offset| 0) (= 4 (select |#length| |merge_pair_~#sub2.base|)) (not (= |merge_pair_~#sub2.base| |merge_pair_~#dst.base|))), 47626#(and (= |merge_pair_~#sub2.offset| 0) (= 4 (select |#length| |merge_pair_~#sub2.base|)))] [2018-02-02 20:42:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:42:26,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:42:26,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:42:26,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:42:26,499 INFO L87 Difference]: Start difference. First operand 558 states and 615 transitions. Second operand 5 states. [2018-02-02 20:42:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:26,637 INFO L93 Difference]: Finished difference Result 554 states and 611 transitions. [2018-02-02 20:42:26,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:42:26,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2018-02-02 20:42:26,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:26,639 INFO L225 Difference]: With dead ends: 554 [2018-02-02 20:42:26,639 INFO L226 Difference]: Without dead ends: 554 [2018-02-02 20:42:26,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:42:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-02-02 20:42:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2018-02-02 20:42:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-02-02 20:42:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 611 transitions. [2018-02-02 20:42:26,646 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 611 transitions. Word has length 116 [2018-02-02 20:42:26,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:26,646 INFO L432 AbstractCegarLoop]: Abstraction has 554 states and 611 transitions. [2018-02-02 20:42:26,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:42:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 611 transitions. [2018-02-02 20:42:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-02 20:42:26,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:26,647 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:26,648 INFO L371 AbstractCegarLoop]: === Iteration 55 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:26,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1384269658, now seen corresponding path program 1 times [2018-02-02 20:42:26,648 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:26,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:42:27,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:27,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:42:27,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:27,126 INFO L182 omatonBuilderFactory]: Interpolants [48737#true, 48738#false, 48739#(= 0 |main_#t~malloc41.offset|), 48740#(= main_~node~1.offset 0), 48741#(= 0 |main_#t~malloc45.offset|), 48742#(= 0 main_~item~0.offset), 48743#(= 0 main_~data~0.offset), 48744#(and (or (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.offset 0)) (or (not (= inspect_before_~shape.offset 0)) (= inspect_before_~shape.base |inspect_before_#in~shape.base|))), 48745#(and (or (= inspect_before_~shape.offset 0) (not (= |inspect_before_#in~shape.offset| 0))) (or (not (= inspect_before_~shape.offset 0)) (= inspect_before_~shape.base |inspect_before_#in~shape.base|))), 48746#(or (not (= |inspect_before_#in~shape.offset| 0)) (= |inspect_before_#t~mem24.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ (- 0) 4)))), 48747#(or (not (= |inspect_before_#in~shape.offset| 0)) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ (- 0) 4)))), 48748#(or (and (= 1 (select |#valid| inspect_before_~shape.base)) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ (- 0) 4)))) (not (= |inspect_before_#in~shape.offset| 0))), 48749#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ (- 0) 4)))) (not (= |inspect_before_#in~shape.offset| 0))), 48750#(and (= 0 main_~data~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))))), 48751#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 48752#(and (= seq_sort_core_~data.base |seq_sort_core_#in~data.base|) (or (= seq_sort_core_~dst~0.base 0) (= (select (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4)) (select (store (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4) seq_sort_core_~dst~0.base) (+ seq_sort_core_~data.offset 4)))) (= |#valid| |old(#valid)|) (= seq_sort_core_~data.offset |seq_sort_core_#in~data.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 48753#(and (= seq_sort_core_~data.base |seq_sort_core_#in~data.base|) (= |#valid| |old(#valid)|) (= seq_sort_core_~data.offset |seq_sort_core_#in~data.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (and (= seq_sort_core_~dst~0.base 0) (= |seq_sort_core_#t~mem18.base| (select (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4)))) (= (select (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4)) (select (store (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4) seq_sort_core_~dst~0.base) (+ seq_sort_core_~data.offset 4))))), 48754#(and (or (and (= seq_sort_core_~next~0.base (select (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4))) (= seq_sort_core_~dst~0.base 0)) (= (select (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4)) (select (store (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4) seq_sort_core_~dst~0.base) (+ seq_sort_core_~data.offset 4)))) (= seq_sort_core_~data.base |seq_sort_core_#in~data.base|) (= |#valid| |old(#valid)|) (= seq_sort_core_~data.offset |seq_sort_core_#in~data.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 48755#(and (= seq_sort_core_~data.base |seq_sort_core_#in~data.base|) (= |#valid| |old(#valid)|) (= seq_sort_core_~data.offset |seq_sort_core_#in~data.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4)) (select (store (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4) seq_sort_core_~dst~0.base) (+ seq_sort_core_~data.offset 4)))), 48756#(and (= (select |old(#memory_$Pointer$.base)| seq_sort_core_~data.base) (select |#memory_$Pointer$.base| seq_sort_core_~data.base)) (= seq_sort_core_~data.base |seq_sort_core_#in~data.base|) (= |#valid| |old(#valid)|) (= seq_sort_core_~data.offset |seq_sort_core_#in~data.offset|)), 48757#(and (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.base)| |seq_sort_core_#in~data.base|) (select |#memory_$Pointer$.base| seq_sort_core_~dst~0.base)) (= seq_sort_core_~dst~0.offset |seq_sort_core_#in~data.offset|)), 48758#(and (= |seq_sort_core_#res.offset| |seq_sort_core_#in~data.offset|) (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.base)| |seq_sort_core_#in~data.base|) (select |#memory_$Pointer$.base| |seq_sort_core_#res.base|))), 48759#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~ret48.base|) (+ 0 4)))) (= 0 |main_#t~ret48.offset|)), 48760#(and (= 0 |seq_sort_core_#in~data.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |seq_sort_core_#in~data.base|) (+ 0 4))))), 48761#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4)))) (= seq_sort_core_~data.offset 0)), 48762#(and (= seq_sort_core_~data.offset 0) (= 1 (select |#valid| |seq_sort_core_#t~mem18.base|))), 48763#(and (= seq_sort_core_~data.offset 0) (= 1 (select |#valid| seq_sort_core_~next~0.base))), 48764#(= 1 (select |#valid| seq_sort_core_~next~0.base))] [2018-02-02 20:42:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:42:27,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:42:27,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:42:27,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:42:27,127 INFO L87 Difference]: Start difference. First operand 554 states and 611 transitions. Second operand 28 states. [2018-02-02 20:42:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:28,942 INFO L93 Difference]: Finished difference Result 574 states and 628 transitions. [2018-02-02 20:42:28,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:42:28,942 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 117 [2018-02-02 20:42:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:28,943 INFO L225 Difference]: With dead ends: 574 [2018-02-02 20:42:28,943 INFO L226 Difference]: Without dead ends: 574 [2018-02-02 20:42:28,943 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=262, Invalid=2288, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 20:42:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-02-02 20:42:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 555. [2018-02-02 20:42:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-02-02 20:42:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 613 transitions. [2018-02-02 20:42:28,947 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 613 transitions. Word has length 117 [2018-02-02 20:42:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:28,947 INFO L432 AbstractCegarLoop]: Abstraction has 555 states and 613 transitions. [2018-02-02 20:42:28,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:42:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 613 transitions. [2018-02-02 20:42:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-02 20:42:28,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:28,948 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:28,948 INFO L371 AbstractCegarLoop]: === Iteration 56 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:28,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1384269659, now seen corresponding path program 1 times [2018-02-02 20:42:28,948 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:28,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:29,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:29,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:42:29,304 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:29,304 INFO L182 omatonBuilderFactory]: Interpolants [49941#true, 49942#false, 49943#(= 0 |main_#t~malloc41.offset|), 49944#(= main_~node~1.offset 0), 49945#(and (= 0 |main_#t~malloc45.offset|) (= main_~node~1.offset 0)), 49946#(and (= 0 main_~item~0.offset) (= main_~node~1.offset 0)), 49947#(= 0 main_~item~0.offset), 49948#(= 0 main_~data~0.offset), 49949#(and (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset)), 49950#(and (= 0 main_~data~0.offset) (= main_~item~0.offset 0)), 49951#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= main_~item~0.offset 0)), 49952#(and (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))), 49953#(and (or (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.offset 0)) (or (not (= inspect_before_~shape.offset 0)) (= inspect_before_~shape.base |inspect_before_#in~shape.base|))), 49954#(and (or (= inspect_before_~shape.offset 0) (not (= |inspect_before_#in~shape.offset| 0))) (or (not (= inspect_before_~shape.offset 0)) (= inspect_before_~shape.base |inspect_before_#in~shape.base|))), 49955#(and (or (= inspect_before_~shape.offset 0) (not (= |inspect_before_#in~shape.offset| 0))) (or (and (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= |inspect_before_#t~mem25.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)) (not (= inspect_before_~shape.offset 0)))), 49956#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)) (not (= inspect_before_~shape.offset 0)) (and (= inspect_before_~shape.base |inspect_before_#in~shape.base|) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))) (or (= inspect_before_~shape.offset 0) (not (= |inspect_before_#in~shape.offset| 0)))), 49957#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ (- 0) 4)))) (not (= |inspect_before_#in~shape.offset| 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ (- 0) 4))))), 49958#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))) (= 0 main_~data~0.offset)), 49959#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 49960#(and (or (= seq_sort_core_~data.offset 0) (= seq_sort_core_~data.offset |seq_sort_core_#in~data.offset|)) (or (and (= seq_sort_core_~data.base |seq_sort_core_#in~data.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= seq_sort_core_~data.offset 0)))), 49961#(and (or (and (= seq_sort_core_~data.base |seq_sort_core_#in~data.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= seq_sort_core_~data.offset 0))) (or (= seq_sort_core_~data.offset 0) (not (= 0 |seq_sort_core_#in~data.offset|)))), 49962#(and (or (and (= seq_sort_core_~data.base |seq_sort_core_#in~data.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4)) |seq_sort_core_#t~mem18.base|)) (not (= seq_sort_core_~data.offset 0))) (or (= seq_sort_core_~data.offset 0) (not (= 0 |seq_sort_core_#in~data.offset|)))), 49963#(and (or (and (= (select (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4)) seq_sort_core_~next~0.base) (= seq_sort_core_~data.base |seq_sort_core_#in~data.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= seq_sort_core_~data.offset 0))) (or (= seq_sort_core_~data.offset 0) (not (= 0 |seq_sort_core_#in~data.offset|)))), 49964#(and (or (and (= seq_sort_core_~data.base |seq_sort_core_#in~data.base|) (= 0 (select (select |#memory_$Pointer$.base| seq_sort_core_~data.base) (+ seq_sort_core_~data.offset 4))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= seq_sort_core_~data.offset 0))) (or (= seq_sort_core_~data.offset 0) (not (= 0 |seq_sort_core_#in~data.offset|)))), 49965#(and (or (= 0 (select (select |old(#memory_$Pointer$.base)| |seq_sort_core_#in~data.base|) (+ seq_sort_core_~data.offset 4))) (not (= seq_sort_core_~data.offset 0))) (or (= seq_sort_core_~data.offset 0) (not (= 0 |seq_sort_core_#in~data.offset|)))), 49966#(or (not (= 0 |seq_sort_core_#in~data.offset|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |seq_sort_core_#in~data.base|) (+ (- 0) 4))))] [2018-02-02 20:42:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:29,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:42:29,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:42:29,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:42:29,305 INFO L87 Difference]: Start difference. First operand 555 states and 613 transitions. Second operand 26 states. [2018-02-02 20:42:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:30,342 INFO L93 Difference]: Finished difference Result 554 states and 599 transitions. [2018-02-02 20:42:30,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:42:30,342 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-02-02 20:42:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:30,343 INFO L225 Difference]: With dead ends: 554 [2018-02-02 20:42:30,343 INFO L226 Difference]: Without dead ends: 549 [2018-02-02 20:42:30,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=1665, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:42:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-02-02 20:42:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 529. [2018-02-02 20:42:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-02-02 20:42:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 579 transitions. [2018-02-02 20:42:30,347 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 579 transitions. Word has length 117 [2018-02-02 20:42:30,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:30,347 INFO L432 AbstractCegarLoop]: Abstraction has 529 states and 579 transitions. [2018-02-02 20:42:30,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:42:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 579 transitions. [2018-02-02 20:42:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-02 20:42:30,348 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:30,348 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:30,348 INFO L371 AbstractCegarLoop]: === Iteration 57 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:30,348 INFO L82 PathProgramCache]: Analyzing trace with hash 486760594, now seen corresponding path program 1 times [2018-02-02 20:42:30,349 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:30,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:42:30,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:30,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:42:30,514 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:30,514 INFO L182 omatonBuilderFactory]: Interpolants [51087#true, 51088#false, 51089#(= 1 (select |#valid| main_~node~1.base)), 51090#(and (not (= 0 |main_#t~malloc45.base|)) (not (= |main_#t~malloc45.base| main_~node~1.base))), 51091#(and (not (= main_~item~0.base main_~node~1.base)) (not (= 0 main_~item~0.base))), 51092#(and (not (= main_~item~0.base (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))) (not (= 0 main_~item~0.base))), 51093#(and (not (= 0 main_~data~0.base)) (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 51094#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|)), 51095#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|) (= |inspect_before_#t~mem27.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))), 51096#(and (= inspect_before_~shape.offset |inspect_before_#in~shape.offset|) (= inspect_before_~shape.base |inspect_before_#in~shape.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))), 51097#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))), 51098#(and (= 1 (select (store |#valid| main_~data~0.base 0) (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (not (= 0 main_~data~0.base))), 51099#(and (= inspect_after_~shape.offset |inspect_after_#in~shape.offset|) (= inspect_after_~shape.base |inspect_after_#in~shape.base|)), 51100#(and (not (= 0 main_~data~0.base)) (= 1 (select (store |#valid| main_~data~0.base 0) |main_#t~mem50.base|))), 51101#(and (not (= 0 main_~data~0.base)) (= 1 (select (store |#valid| main_~data~0.base 0) main_~node~2.base))), 51102#(= 1 (select |#valid| main_~node~2.base))] [2018-02-02 20:42:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:42:30,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:42:30,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:42:30,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:42:30,515 INFO L87 Difference]: Start difference. First operand 529 states and 579 transitions. Second operand 16 states. [2018-02-02 20:42:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:31,011 INFO L93 Difference]: Finished difference Result 546 states and 596 transitions. [2018-02-02 20:42:31,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:42:31,011 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 123 [2018-02-02 20:42:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:31,012 INFO L225 Difference]: With dead ends: 546 [2018-02-02 20:42:31,012 INFO L226 Difference]: Without dead ends: 546 [2018-02-02 20:42:31,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:42:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-02-02 20:42:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 530. [2018-02-02 20:42:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-02-02 20:42:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 581 transitions. [2018-02-02 20:42:31,016 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 581 transitions. Word has length 123 [2018-02-02 20:42:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:31,016 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 581 transitions. [2018-02-02 20:42:31,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:42:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 581 transitions. [2018-02-02 20:42:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-02 20:42:31,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:31,016 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:42:31,017 INFO L371 AbstractCegarLoop]: === Iteration 58 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:31,017 INFO L82 PathProgramCache]: Analyzing trace with hash 486760595, now seen corresponding path program 1 times [2018-02-02 20:42:31,017 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:31,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:42:31,154 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:42:31,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:42:31,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:31,154 INFO L182 omatonBuilderFactory]: Interpolants [52210#true, 52211#false, 52212#(= 0 |main_#t~malloc41.offset|), 52213#(= 0 main_~node~1.offset), 52214#(= 0 (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset)), 52215#(= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)), 52216#(and (= inspect_after_~shape.offset |inspect_after_#in~shape.offset|) (= inspect_after_~shape.base |inspect_after_#in~shape.base|)), 52217#(= |inspect_after_#t~mem36.base| (select (select |#memory_$Pointer$.base| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|)), 52218#(= inspect_after_~pos~0.base (select (select |#memory_$Pointer$.base| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|)), 52219#(and (= inspect_after_~pos~0.base (select (select |#memory_$Pointer$.base| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|)) (<= 4 (select |#length| inspect_after_~pos~0.base))), 52220#(<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_after_#in~shape.base|) |inspect_after_#in~shape.offset|))), 52221#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 52222#(and (= 0 |main_#t~mem50.offset|) (<= 4 (select |#length| |main_#t~mem50.base|))), 52223#(and (= 0 main_~node~2.offset) (<= 4 (select |#length| main_~node~2.base)))] [2018-02-02 20:42:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:42:31,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:42:31,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:42:31,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:42:31,155 INFO L87 Difference]: Start difference. First operand 530 states and 581 transitions. Second operand 14 states. [2018-02-02 20:42:31,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:31,502 INFO L93 Difference]: Finished difference Result 571 states and 627 transitions. [2018-02-02 20:42:31,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:42:31,503 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 123 [2018-02-02 20:42:31,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:31,504 INFO L225 Difference]: With dead ends: 571 [2018-02-02 20:42:31,504 INFO L226 Difference]: Without dead ends: 571 [2018-02-02 20:42:31,504 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:42:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-02-02 20:42:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 532. [2018-02-02 20:42:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-02-02 20:42:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 582 transitions. [2018-02-02 20:42:31,507 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 582 transitions. Word has length 123 [2018-02-02 20:42:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:31,507 INFO L432 AbstractCegarLoop]: Abstraction has 532 states and 582 transitions. [2018-02-02 20:42:31,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:42:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 582 transitions. [2018-02-02 20:42:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-02 20:42:31,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:31,508 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:31,508 INFO L371 AbstractCegarLoop]: === Iteration 59 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:31,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1410838114, now seen corresponding path program 2 times [2018-02-02 20:42:31,509 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:31,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 11 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:33,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:33,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 20:42:33,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:33,908 INFO L182 omatonBuilderFactory]: Interpolants [53376#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (or (and (= |inspect_before_#t~mem27.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) (= |inspect_before_#t~mem27.offset| 0)) (= |inspect_before_#t~mem27.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0)) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= inspect_before_~shape.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))), 53377#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0) |inspect_before_#t~mem28.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0) |inspect_before_#t~mem28.base|)) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0)))), 53378#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0)) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))), 53379#(and (= 0 |inspect_before_#t~mem24.offset|) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) (+ 0 4))) 0))) (= (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) (+ 0 4))) 0)) (= |inspect_before_#t~mem24.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) (+ 0 4))) 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) (+ 0 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) (+ 0 4))) 0)))) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#t~mem24.base|) (+ 0 4)))), 53380#(or (and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))))) (<= (+ inspect_before_~shape.offset 1) 0)), 53381#(or (<= (+ inspect_before_~shape.offset 1) 0) (and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)))))), 53382#(or (and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (or (and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.offset|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))))) (<= (+ inspect_before_~shape.offset 1) 0)), 53383#(or (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (<= (+ inspect_before_~shape.offset 1) 0)), 53384#(or (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))), 53385#(or (= |inspect_before_#t~mem27.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))), 53386#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))), 53387#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|)))), 53388#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))), 53389#(or (and (= |inspect_before_#t~mem31.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)) (= |inspect_before_#t~mem31.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))), 53390#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))), 53391#(= 1 (select |#valid| |inspect_before_#t~mem32.base|)), 53349#true, 53350#false, 53351#(and (= 1 (select |#valid| |main_#t~malloc41.base|)) (= 0 |main_#t~malloc41.offset|)), 53352#(and (= 1 (select |#valid| main_~node~1.base)) (= main_~node~1.offset 0)), 53353#(and (= 1 (select |#valid| main_~node~1.base)) (= 0 |main_#t~malloc45.offset|) (= main_~node~1.offset 0)), 53354#(and (= 1 (select |#valid| main_~node~1.base)) (= main_~node~1.offset 0) (= main_~item~0.offset 0)), 53355#(and (= (select |#valid| main_~item~0.base) 1) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))) (= main_~item~0.offset 0)), 53356#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 main_~data~0.offset) (= (select |#valid| main_~data~0.base) 1)), 53357#(and (not (= main_~data~0.base |main_#t~malloc41.base|)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= |main_#t~malloc41.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 main_~data~0.offset)), 53358#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0))) (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0))) (not (= main_~node~1.base main_~data~0.base)) (= 0 main_~data~0.offset)), 53359#(and (= 0 main_~data~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= main_~node~1.base (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)))), 53360#(and (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= main_~node~1.base (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= (select |#valid| |main_#t~malloc45.base|) 1)), 53361#(and (= (select |#valid| main_~item~0.base) 1) (= 0 main_~data~0.offset) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) 0))) (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) 0))) (= main_~item~0.offset 0)), 53362#(and (= (select |#valid| main_~item~0.base) 1) (= 0 main_~data~0.offset) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) 0))) (= (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) 0))) (= main_~item~0.offset 0)), 53363#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= (select |#valid| main_~item~0.base) 1) (or (= (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0)))) (= main_~item~0.offset 0)), 53364#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))) (= (select (select |#memory_$Pointer$.base| main_~data~0.base) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (= (select |#valid| main_~data~0.base) 1)), 53365#(and (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (or (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (not (= main_~data~0.base |main_#t~malloc41.base|)) (= (select |#valid| main_~data~0.base) 1)) (and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))) (= |main_#t~malloc41.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)) (= (select (select |#memory_$Pointer$.base| main_~data~0.base) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))) (= |main_#t~malloc41.offset| 0) (not (= main_~data~0.base |main_#t~malloc41.base|)) (= (select |#valid| main_~data~0.base) 1)))), 53366#(and (or (and (or (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))) 0)) (= (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0) (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))) 0)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))) 0)))) (not (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))))) (and (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))) (= main_~node~1.offset 0))) (not (= main_~node~1.base main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~node~1.base (store (select |#memory_$Pointer$.offset| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))) (= 0 main_~data~0.offset) (= (select |#valid| main_~data~0.base) 1)), 53367#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))) (= (select (select |#memory_$Pointer$.base| main_~data~0.base) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)) (= main_~node~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)) (and (= main_~node~1.offset 0) (= main_~node~1.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (= (select |#valid| main_~data~0.base) 1)), 53368#(and (not (= main_~data~0.base |main_#t~malloc45.base|)) (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (or (= |main_#t~malloc45.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)) (= (select (select |#memory_$Pointer$.base| main_~data~0.base) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)) (= main_~node~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)) (and (= main_~node~1.offset 0) (= main_~node~1.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)))))), 53369#(and (or (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4))) 0)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4))) 0))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4))) 0)) (and (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4))) (= main_~node~1.offset 0)) (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) 0) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4))) 0)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4))) 0))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset main_~node~1.offset)) main_~data~0.base) (+ 0 4))) (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (= main_~item~0.offset 0)), 53370#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset)) main_~data~0.base) (+ 0 4))) (= 0 main_~data~0.offset) (or (and (= (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4))) (= (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset) 0)) (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) 0) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4))) 0)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4))) 0)) (= (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4))) 0)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4))) 0)))) (= main_~item~0.offset 0)), 53371#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) 0))) (= (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) 0)) (and (= (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0)) (= (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= main_~item~0.offset 0)), 53372#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) 0)) (and (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0)) (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) 0)) (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) 0))))), 53373#(and (= 0 |inspect_before_#in~shape.offset|) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4))) 0)) (= (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4))) 0))) (and (= (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|) 0)) (= (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4)))), 53374#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (or (and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset) 0)) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0)) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))), 53375#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (or (and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset) 0)) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0)) (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= |inspect_before_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))))] [2018-02-02 20:42:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 11 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:33,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 20:42:33,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 20:42:33,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1703, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:42:33,909 INFO L87 Difference]: Start difference. First operand 532 states and 582 transitions. Second operand 43 states. [2018-02-02 20:42:35,842 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 176 DAG size of output 101 [2018-02-02 20:42:35,992 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 133 DAG size of output 93 [2018-02-02 20:42:36,187 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 144 DAG size of output 95 [2018-02-02 20:42:36,398 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 174 DAG size of output 97 [2018-02-02 20:42:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:39,579 INFO L93 Difference]: Finished difference Result 557 states and 610 transitions. [2018-02-02 20:42:39,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 20:42:39,580 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 122 [2018-02-02 20:42:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:39,581 INFO L225 Difference]: With dead ends: 557 [2018-02-02 20:42:39,581 INFO L226 Difference]: Without dead ends: 557 [2018-02-02 20:42:39,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 5 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=717, Invalid=6255, Unknown=0, NotChecked=0, Total=6972 [2018-02-02 20:42:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-02-02 20:42:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2018-02-02 20:42:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-02-02 20:42:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 584 transitions. [2018-02-02 20:42:39,585 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 584 transitions. Word has length 122 [2018-02-02 20:42:39,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:39,585 INFO L432 AbstractCegarLoop]: Abstraction has 533 states and 584 transitions. [2018-02-02 20:42:39,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 20:42:39,585 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 584 transitions. [2018-02-02 20:42:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-02 20:42:39,586 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:39,586 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:39,586 INFO L371 AbstractCegarLoop]: === Iteration 60 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:39,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1410838113, now seen corresponding path program 2 times [2018-02-02 20:42:39,586 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:39,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:43,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:43,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 20:42:43,374 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:43,375 INFO L182 omatonBuilderFactory]: Interpolants [54592#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (or (and (or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0) main_~data~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) 0))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))) (and (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0)) (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))))), 54593#(and (= 0 |inspect_before_#in~shape.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) (+ 0 4))) (or (and (= (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|) 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))) (= |inspect_before_#in~shape.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4)))) (and (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4))) 0))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) 0) |inspect_before_#in~shape.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) 0)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) (+ 0 4))) (+ 0 4)))), 54594#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))))) (and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))), 54595#(and (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))))) (and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))), 54596#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (or (and (= |inspect_before_#t~mem27.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) (= |inspect_before_#t~mem27.offset| 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))))) (and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (= 8 (select |#length| |inspect_before_#t~mem27.base|)) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) (= |inspect_before_#t~mem27.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))), 54597#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0) |inspect_before_#t~mem28.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0) |inspect_before_#t~mem28.base|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))), 54598#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= inspect_before_~shape.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0))))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (= inspect_before_~shape.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4))) 0)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (+ 0 4)))), 54599#(and (= 0 |inspect_before_#t~mem24.offset|) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) (+ 0 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) (+ 0 4))) 0))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) (+ 0 4))) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) (+ 0 4))) 0))))) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#t~mem24.base|) (+ 0 4)))), 54600#(or (<= (+ inspect_before_~shape.offset 1) 0) (and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)) 0)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)))))), 54601#(or (<= (+ inspect_before_~shape.offset 1) 0) (and (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)) 0)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) 0)))))), 54602#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (<= (+ inspect_before_~shape.offset 1) 0) (and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)) 0))))), 54603#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset) |inspect_before_#t~mem26.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)) 0)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))), 54604#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset))))), 54605#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem27.base|) |inspect_before_#t~mem27.offset|)))), 54606#(or (not (= 0 |inspect_before_#t~mem28.base|)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))), 54607#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))), 54608#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |inspect_before_#t~mem24.base|) |inspect_before_#t~mem24.offset|)))), 54609#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))), 54610#(or (and (= |inspect_before_#t~mem31.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)) (= |inspect_before_#t~mem31.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset)))), 54611#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) inspect_before_~shape.offset))), 54612#(and (= |inspect_before_#t~mem32.offset| 0) (= (select |#length| |inspect_before_#t~mem32.base|) 8)), 54567#true, 54568#false, 54569#(and (= 8 (select |#length| |main_#t~malloc41.base|)) (= 0 |main_#t~malloc41.offset|)), 54570#(and (= 8 (select |#length| main_~node~1.base)) (= main_~node~1.offset 0)), 54571#(and (= 8 (select |#length| main_~node~1.base)) (= (select |#valid| main_~node~1.base) 1) (= main_~node~1.offset 0)), 54572#(and (= 0 |main_#t~malloc45.offset|) (= 8 (select |#length| main_~node~1.base)) (= main_~node~1.offset 0)), 54573#(and (= 8 (select |#length| main_~node~1.base)) (= main_~node~1.offset 0) (= main_~item~0.offset 0)), 54574#(and (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset)) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.offset 0)), 54575#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 main_~data~0.offset) (= (select |#valid| main_~data~0.base) 1)), 54576#(and (= 8 (select |#length| |main_#t~malloc41.base|)) (= 0 |main_#t~malloc41.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (not (= main_~data~0.base |main_#t~malloc41.base|)) (= 0 main_~data~0.offset) (= (select |#valid| |main_#t~malloc41.base|) 1)), 54577#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0))) (not (= main_~node~1.base main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 main_~node~1.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~node~1.base (store (select |#memory_$Pointer$.offset| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0)) (= 8 (select |#length| main_~node~1.base)) (= (select |#valid| main_~node~1.base) 1)), 54578#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 main_~data~0.offset) (= 0 main_~node~1.offset) (= 8 (select |#length| main_~node~1.base)) (= (select |#valid| main_~node~1.base) 1)), 54579#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset) (= 0 main_~node~1.offset) (= 8 (select |#length| main_~node~1.base)) (= (select |#valid| main_~node~1.base) 1) (= (select |#valid| |main_#t~malloc45.base|) 1)), 54580#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) 0))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset main_~node~1.offset)) main_~data~0.base) 0)) (= (select |#valid| main_~item~0.base) 1) (= 0 main_~data~0.offset) (= 0 main_~node~1.offset) (= (select |#valid| main_~node~1.base) 1) (= main_~item~0.offset 0)), 54581#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) 0))) (= (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset)) 1) (= (select |#valid| main_~item~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset)) main_~data~0.base) 0)) (= 0 main_~data~0.offset) (= main_~item~0.offset 0)), 54582#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) 1) (= (select |#valid| main_~item~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0)) (= main_~item~0.offset 0)), 54583#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)) (= (select |#valid| main_~data~0.base) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)))), 54584#(and (= 0 |main_#t~malloc41.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (not (= main_~data~0.base |main_#t~malloc41.base|)) (or (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)))) (and (= 8 (select |#length| |main_#t~malloc41.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)) (= (select |#valid| main_~data~0.base) 1) (not (= 0 |main_#t~malloc41.base|))), 54585#(and (not (= main_~node~1.base main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~node~1.base (store (select |#memory_$Pointer$.offset| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))) (= 0 main_~data~0.offset) (= (select |#valid| main_~data~0.base) 1) (or (and (or (and (= 8 (select |#length| main_~node~1.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))) 0)))) (and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0))) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~node~1.base (store (select |#memory_$Pointer$.offset| main_~node~1.base) main_~node~1.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))) 0)) (= 0 main_~node~1.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~node~1.base (store (select |#memory_$Pointer$.offset| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) 0)) (not (= 0 main_~node~1.base))) (and (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~node~1.base (store (select |#memory_$Pointer$.base| main_~node~1.base) main_~node~1.offset 0)) main_~data~0.base) (+ 0 4))) (= main_~node~1.offset 0)))), 54586#(and (or (and (or (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)))) (and (= 8 (select |#length| main_~node~1.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 main_~node~1.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)) (not (= 0 main_~node~1.base)) (= (select |#valid| main_~node~1.base) 1)) (and (= main_~node~1.offset 0) (= main_~node~1.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))))) (not (= main_~node~1.base main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (= (select |#valid| main_~data~0.base) 1)), 54587#(and (= 0 main_~data~0.offset) (or (and (or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)) (= 8 (select |#length| main_~node~1.base)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 main_~node~1.offset) (not (= 0 main_~node~1.base)) (= (select |#valid| main_~node~1.base) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0)))) (and (= main_~node~1.offset 0) (= main_~node~1.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4))) (= (select |#valid| main_~data~0.base) 1)), 54588#(and (not (= main_~data~0.base |main_#t~malloc45.base|)) (or (and (or (and (or (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) 0)))) (and (= 8 (select |#length| main_~node~1.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))) 0))) (and (= (select (select |#memory_$Pointer$.base| main_~data~0.base) 0) |main_#t~malloc45.base|) (not (= 0 main_~node~1.base)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) 0)) (= 0 main_~node~1.offset) (not (= main_~node~1.base |main_#t~malloc45.base|))) (and (= main_~node~1.offset 0) (= main_~node~1.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ 0 4))))) (= 0 |main_#t~malloc45.offset|) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ 0 4)))), 54589#(and (or (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4))) (= 0 main_~node~1.offset) (= 8 (select |#length| main_~node~1.base))) (and (= main_~node~1.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4))) (= main_~node~1.offset 0)) (and (or (and (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) 0) main_~item~0.base) (not (= 0 main_~node~1.base))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset main_~node~1.offset)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4))) 0)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset main_~node~1.base)) main_~data~0.base) (+ 0 4))) 0))))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset main_~node~1.offset)) main_~data~0.base) 0)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset main_~node~1.offset)) main_~data~0.base) (+ 0 4))) (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (= main_~item~0.offset 0)), 54590#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset)) main_~data~0.base) (+ 0 4))) (= 0 main_~data~0.offset) (or (and (or (and (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) 0) main_~item~0.base) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset)))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4))) 0)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4))) 0))))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset)) main_~data~0.base) 0))) (and (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset))) (and (= (select (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base) main_~item~0.offset) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.base)) main_~data~0.base) (+ 0 4))) (= (select (store (select |#memory_$Pointer$.offset| main_~item~0.base) (+ main_~item~0.offset 4) main_~data~0.offset) main_~item~0.offset) 0))) (= main_~item~0.offset 0)), 54591#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0)) (or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) 0) main_~item~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) 0))))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4)))) (and (= (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~item~0.base) (+ main_~item~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (+ 0 4))) (= main_~item~0.offset 0))] [2018-02-02 20:42:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:43,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 20:42:43,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 20:42:43,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1952, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:42:43,375 INFO L87 Difference]: Start difference. First operand 533 states and 584 transitions. Second operand 46 states. [2018-02-02 20:42:45,084 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 160 DAG size of output 97 [2018-02-02 20:42:45,755 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 171 DAG size of output 107 [2018-02-02 20:42:46,057 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 211 DAG size of output 136 [2018-02-02 20:42:46,282 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 180 DAG size of output 119 [2018-02-02 20:42:46,567 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 190 DAG size of output 125 [2018-02-02 20:42:46,874 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 213 DAG size of output 135 [2018-02-02 20:42:47,443 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 108 DAG size of output 108 [2018-02-02 20:42:47,653 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 114 DAG size of output 114 [2018-02-02 20:42:51,381 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 140 DAG size of output 138 [2018-02-02 20:42:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:51,443 INFO L93 Difference]: Finished difference Result 585 states and 638 transitions. [2018-02-02 20:42:51,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 20:42:51,443 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 122 [2018-02-02 20:42:51,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:51,444 INFO L225 Difference]: With dead ends: 585 [2018-02-02 20:42:51,444 INFO L226 Difference]: Without dead ends: 585 [2018-02-02 20:42:51,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 4 SyntacticMatches, 8 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1517 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=793, Invalid=6863, Unknown=0, NotChecked=0, Total=7656 [2018-02-02 20:42:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-02-02 20:42:51,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 519. [2018-02-02 20:42:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-02-02 20:42:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 569 transitions. [2018-02-02 20:42:51,449 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 569 transitions. Word has length 122 [2018-02-02 20:42:51,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:51,449 INFO L432 AbstractCegarLoop]: Abstraction has 519 states and 569 transitions. [2018-02-02 20:42:51,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 20:42:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 569 transitions. [2018-02-02 20:42:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-02 20:42:51,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:51,450 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:51,450 INFO L371 AbstractCegarLoop]: === Iteration 61 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 20:42:51,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1107489152, now seen corresponding path program 2 times [2018-02-02 20:42:51,451 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:51,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 20:42:52,046 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:42:52,052 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:42:52,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:42:52 BoogieIcfgContainer [2018-02-02 20:42:52,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:42:52,053 INFO L168 Benchmark]: Toolchain (without parser) took 71912.45 ms. Allocated memory was 396.4 MB in the beginning and 1.4 GB in the end (delta: 971.5 MB). Free memory was 353.0 MB in the beginning and 727.6 MB in the end (delta: -374.6 MB). Peak memory consumption was 596.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:42:52,055 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 396.4 MB. Free memory is still 358.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:42:52,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.98 ms. Allocated memory is still 396.4 MB. Free memory was 353.0 MB in the beginning and 339.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:42:52,055 INFO L168 Benchmark]: Boogie Preprocessor took 43.14 ms. Allocated memory is still 396.4 MB. Free memory was 339.8 MB in the beginning and 337.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:42:52,055 INFO L168 Benchmark]: RCFGBuilder took 582.66 ms. Allocated memory is still 396.4 MB. Free memory was 337.2 MB in the beginning and 266.4 MB in the end (delta: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 5.3 GB. [2018-02-02 20:42:52,055 INFO L168 Benchmark]: TraceAbstraction took 71110.17 ms. Allocated memory was 396.4 MB in the beginning and 1.4 GB in the end (delta: 971.5 MB). Free memory was 266.4 MB in the beginning and 727.6 MB in the end (delta: -461.2 MB). Peak memory consumption was 510.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:42:52,057 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.14 ms. Allocated memory is still 396.4 MB. Free memory is still 358.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 172.98 ms. Allocated memory is still 396.4 MB. Free memory was 353.0 MB in the beginning and 339.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.14 ms. Allocated memory is still 396.4 MB. Free memory was 339.8 MB in the beginning and 337.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 582.66 ms. Allocated memory is still 396.4 MB. Free memory was 337.2 MB in the beginning and 266.4 MB in the end (delta: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 71110.17 ms. Allocated memory was 396.4 MB in the beginning and 1.4 GB in the end (delta: 971.5 MB). Free memory was 266.4 MB in the beginning and 727.6 MB in the end (delta: -461.2 MB). Peak memory consumption was 510.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 598). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 597). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 588). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 598). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 597). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 588). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 613). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 607). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 607). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 612). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 608). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 612). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 613). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 608). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 625]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 623). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 619). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 619). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 623). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 123 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 315 locations, 109 error locations. TIMEOUT Result, 71.0s OverallTime, 61 OverallIterations, 4 TraceHistogramMax, 49.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16146 SDtfs, 14222 SDslu, 103248 SDs, 0 SdLazy, 69792 SolverSat, 2891 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1528 GetRequests, 168 SyntacticMatches, 124 SemanticMatches, 1236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8501 ImplicationChecksByTransitivity, 30.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=570occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 656/1188 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 60 MinimizatonAttempts, 1346 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 4744 NumberOfCodeBlocks, 4744 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 4684 ConstructedInterpolants, 0 QuantifiedInterpolants, 6107586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 60 InterpolantComputations, 35 PerfectInterpolantSequences, 656/1188 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-42-52-065.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-42-52-065.csv Completed graceful shutdown