./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:28:31,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:28:32,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:28:32,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:28:32,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:28:32,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:28:32,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:28:32,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:28:32,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:28:32,089 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:28:32,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:28:32,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:28:32,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:28:32,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:28:32,091 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:28:32,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:28:32,092 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:28:32,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:28:32,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:28:32,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:28:32,093 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:28:32,097 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:28:32,097 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:28:32,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:28:32,097 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:28:32,097 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:28:32,097 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:28:32,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:28:32,098 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:28:32,098 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:28:32,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:28:32,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:28:32,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:28:32,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:28:32,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:28:32,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:28:32,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:28:32,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:28:32,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:28:32,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:28:32,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:28:32,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:28:32,101 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2024-11-10 15:28:32,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:28:32,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:28:32,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:28:32,367 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:28:32,367 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:28:32,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2024-11-10 15:28:33,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:28:33,871 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:28:33,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2024-11-10 15:28:33,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef316c04c/7e36f1302e4342f0bbff7834fd3868cc/FLAGbdb80f111 [2024-11-10 15:28:34,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef316c04c/7e36f1302e4342f0bbff7834fd3868cc [2024-11-10 15:28:34,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:28:34,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:28:34,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:28:34,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:28:34,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:28:34,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60acc8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34, skipping insertion in model container [2024-11-10 15:28:34,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:28:34,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:28:34,529 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:28:34,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:28:34,596 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:28:34,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34 WrapperNode [2024-11-10 15:28:34,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:28:34,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:28:34,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:28:34,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:28:34,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,632 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2024-11-10 15:28:34,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:28:34,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:28:34,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:28:34,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:28:34,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,666 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-10 15:28:34,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,672 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:28:34,686 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:28:34,686 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:28:34,686 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:28:34,690 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34" (1/1) ... [2024-11-10 15:28:34,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:28:34,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:34,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:28:34,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:28:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-10 15:28:34,771 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-10 15:28:34,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:28:34,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:28:34,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:28:34,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:28:34,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:28:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:28:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:28:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:28:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:28:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:28:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:28:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:28:34,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:28:34,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:28:34,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:28:34,904 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:28:34,905 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:28:34,931 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-10 15:28:35,123 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: havoc dll_get_data_at_#t~mem9#1; [2024-11-10 15:28:35,143 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-10 15:28:35,143 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:28:35,159 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:28:35,159 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:28:35,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:28:35 BoogieIcfgContainer [2024-11-10 15:28:35,159 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:28:35,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:28:35,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:28:35,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:28:35,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:28:34" (1/3) ... [2024-11-10 15:28:35,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fce9de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:28:35, skipping insertion in model container [2024-11-10 15:28:35,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:34" (2/3) ... [2024-11-10 15:28:35,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fce9de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:28:35, skipping insertion in model container [2024-11-10 15:28:35,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:28:35" (3/3) ... [2024-11-10 15:28:35,166 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2024-11-10 15:28:35,179 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:28:35,179 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-10 15:28:35,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:28:35,227 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@766fbebc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:28:35,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-10 15:28:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 52 states have (on average 1.75) internal successors, (91), 75 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:28:35,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:35,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:28:35,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:35,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:35,243 INFO L85 PathProgramCache]: Analyzing trace with hash -272634277, now seen corresponding path program 1 times [2024-11-10 15:28:35,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:35,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232083884] [2024-11-10 15:28:35,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:35,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232083884] [2024-11-10 15:28:35,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232083884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:35,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:35,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:28:35,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316234431] [2024-11-10 15:28:35,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:35,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:35,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:35,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:35,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:35,445 INFO L87 Difference]: Start difference. First operand has 77 states, 52 states have (on average 1.75) internal successors, (91), 75 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:35,508 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-11-10 15:28:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:35,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 15:28:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:35,516 INFO L225 Difference]: With dead ends: 73 [2024-11-10 15:28:35,516 INFO L226 Difference]: Without dead ends: 67 [2024-11-10 15:28:35,517 INFO L431 NwaCegarLoop]: 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 [2024-11-10 15:28:35,520 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:35,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-10 15:28:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-10 15:28:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.553191489361702) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-11-10 15:28:35,547 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 6 [2024-11-10 15:28:35,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:35,547 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-11-10 15:28:35,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,548 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-11-10 15:28:35,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:28:35,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:35,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:28:35,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:28:35,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:35,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash -272634276, now seen corresponding path program 1 times [2024-11-10 15:28:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:35,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592182329] [2024-11-10 15:28:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:35,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:35,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:35,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592182329] [2024-11-10 15:28:35,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592182329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:35,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:35,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:28:35,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308180596] [2024-11-10 15:28:35,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:35,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:35,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:35,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:35,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:35,635 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:35,667 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-10 15:28:35,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:35,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 15:28:35,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:35,668 INFO L225 Difference]: With dead ends: 64 [2024-11-10 15:28:35,669 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 15:28:35,669 INFO L431 NwaCegarLoop]: 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 [2024-11-10 15:28:35,670 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:35,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 109 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 15:28:35,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 15:28:35,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-10 15:28:35,675 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 6 [2024-11-10 15:28:35,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:35,676 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-10 15:28:35,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-10 15:28:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:28:35,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:35,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:35,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:28:35,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:35,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:35,678 INFO L85 PathProgramCache]: Analyzing trace with hash 389508085, now seen corresponding path program 1 times [2024-11-10 15:28:35,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:35,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431156412] [2024-11-10 15:28:35,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:35,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:35,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:35,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431156412] [2024-11-10 15:28:35,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431156412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:35,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:35,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:28:35,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515531567] [2024-11-10 15:28:35,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:35,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:35,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:35,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:35,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:35,767 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:35,785 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-10 15:28:35,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:35,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 15:28:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:35,786 INFO L225 Difference]: With dead ends: 72 [2024-11-10 15:28:35,787 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 15:28:35,787 INFO L431 NwaCegarLoop]: 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 [2024-11-10 15:28:35,787 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:35,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:35,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 15:28:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-11-10 15:28:35,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2024-11-10 15:28:35,793 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 10 [2024-11-10 15:28:35,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:35,793 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2024-11-10 15:28:35,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,794 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2024-11-10 15:28:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:28:35,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:35,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:35,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:28:35,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:35,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:35,795 INFO L85 PathProgramCache]: Analyzing trace with hash 761259430, now seen corresponding path program 1 times [2024-11-10 15:28:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:35,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123817226] [2024-11-10 15:28:35,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:35,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:35,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:35,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123817226] [2024-11-10 15:28:35,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123817226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:35,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:35,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:28:35,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269670504] [2024-11-10 15:28:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:35,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:28:35,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:35,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:28:35,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:28:35,853 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:35,866 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-11-10 15:28:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:28:35,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 15:28:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:35,867 INFO L225 Difference]: With dead ends: 72 [2024-11-10 15:28:35,867 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 15:28:35,867 INFO L431 NwaCegarLoop]: 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 [2024-11-10 15:28:35,868 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:35,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 15:28:35,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-11-10 15:28:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2024-11-10 15:28:35,873 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 11 [2024-11-10 15:28:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:35,874 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2024-11-10 15:28:35,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2024-11-10 15:28:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:28:35,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:35,876 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:35,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:28:35,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:35,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:35,877 INFO L85 PathProgramCache]: Analyzing trace with hash -944532217, now seen corresponding path program 1 times [2024-11-10 15:28:35,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:35,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768569790] [2024-11-10 15:28:35,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:35,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:36,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768569790] [2024-11-10 15:28:36,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768569790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:36,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117508145] [2024-11-10 15:28:36,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:36,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:36,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:36,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:36,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:28:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:36,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:28:36,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:36,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:36,300 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:28:36,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:28:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:36,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:36,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117508145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:36,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:36,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-10 15:28:36,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109449599] [2024-11-10 15:28:36,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:36,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:28:36,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:36,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:28:36,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:36,370 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:36,460 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-11-10 15:28:36,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:36,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 15:28:36,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:36,461 INFO L225 Difference]: With dead ends: 70 [2024-11-10 15:28:36,461 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 15:28:36,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:28:36,462 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:36,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 183 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:36,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 15:28:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-10 15:28:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-11-10 15:28:36,470 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 18 [2024-11-10 15:28:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:36,470 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-11-10 15:28:36,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-11-10 15:28:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:28:36,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:36,471 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:36,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 15:28:36,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:36,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:36,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash -944532216, now seen corresponding path program 1 times [2024-11-10 15:28:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:36,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54208847] [2024-11-10 15:28:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:36,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:36,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54208847] [2024-11-10 15:28:36,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54208847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:36,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759975679] [2024-11-10 15:28:36,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:36,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:36,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:36,870 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:36,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 15:28:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:36,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 15:28:36,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:36,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:36,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:28:37,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:37,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:28:37,077 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:37,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:28:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:37,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:37,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759975679] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:37,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:37,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-10 15:28:37,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321307226] [2024-11-10 15:28:37,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:37,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:28:37,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:37,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:28:37,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:28:37,400 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:37,538 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-11-10 15:28:37,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:37,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 15:28:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:37,539 INFO L225 Difference]: With dead ends: 69 [2024-11-10 15:28:37,539 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 15:28:37,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:28:37,539 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 17 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:37,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 320 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:37,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 15:28:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-10 15:28:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-11-10 15:28:37,549 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 18 [2024-11-10 15:28:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:37,549 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-11-10 15:28:37,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-11-10 15:28:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:28:37,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:37,550 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:37,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:28:37,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 15:28:37,750 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:37,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:37,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1939284268, now seen corresponding path program 1 times [2024-11-10 15:28:37,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:37,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925445521] [2024-11-10 15:28:37,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:37,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:37,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925445521] [2024-11-10 15:28:37,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925445521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:37,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327356297] [2024-11-10 15:28:37,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:37,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:37,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:37,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:37,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 15:28:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:37,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:28:37,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:37,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:37,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:37,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327356297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:37,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:37,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-10 15:28:37,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94188238] [2024-11-10 15:28:37,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:37,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:28:37,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:37,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:28:37,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:37,914 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:37,926 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-11-10 15:28:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:28:37,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 15:28:37,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:37,930 INFO L225 Difference]: With dead ends: 72 [2024-11-10 15:28:37,930 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 15:28:37,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:37,930 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:37,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 248 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:37,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 15:28:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-10 15:28:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.368421052631579) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-10 15:28:37,936 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2024-11-10 15:28:37,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:37,936 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-10 15:28:37,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-10 15:28:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:28:37,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:37,937 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:37,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:38,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:38,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:38,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1749759486, now seen corresponding path program 2 times [2024-11-10 15:28:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145165407] [2024-11-10 15:28:38,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:38,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:38,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145165407] [2024-11-10 15:28:38,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145165407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:38,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162171188] [2024-11-10 15:28:38,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:28:38,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:38,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:38,201 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:38,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 15:28:38,265 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 15:28:38,266 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:28:38,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:28:38,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:38,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:28:38,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162171188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:38,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:28:38,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2024-11-10 15:28:38,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901993878] [2024-11-10 15:28:38,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:38,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:28:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:28:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:38,330 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:38,369 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-11-10 15:28:38,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:28:38,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-10 15:28:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:38,369 INFO L225 Difference]: With dead ends: 70 [2024-11-10 15:28:38,370 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 15:28:38,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:28:38,370 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:38,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 124 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 15:28:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-11-10 15:28:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-11-10 15:28:38,376 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 27 [2024-11-10 15:28:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:38,376 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-11-10 15:28:38,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-11-10 15:28:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:28:38,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:38,377 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:38,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:38,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:38,577 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:38,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1749759451, now seen corresponding path program 1 times [2024-11-10 15:28:38,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:38,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109619906] [2024-11-10 15:28:38,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:38,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:38,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:38,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109619906] [2024-11-10 15:28:38,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109619906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:38,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564081721] [2024-11-10 15:28:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:38,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:38,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:38,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:38,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:28:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:38,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:28:38,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:38,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:38,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564081721] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:38,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:38,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-10 15:28:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493698978] [2024-11-10 15:28:38,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:38,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:28:38,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:38,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:28:38,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:28:38,761 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:38,783 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2024-11-10 15:28:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:38,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-10 15:28:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:38,784 INFO L225 Difference]: With dead ends: 60 [2024-11-10 15:28:38,784 INFO L226 Difference]: Without dead ends: 60 [2024-11-10 15:28:38,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:28:38,785 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:38,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 121 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:38,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-10 15:28:38,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-10 15:28:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.26) internal successors, (63), 59 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2024-11-10 15:28:38,787 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 27 [2024-11-10 15:28:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:38,787 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2024-11-10 15:28:38,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2024-11-10 15:28:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:28:38,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:38,788 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:38,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 15:28:38,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:38,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:38,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash 896739102, now seen corresponding path program 1 times [2024-11-10 15:28:38,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:38,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495153573] [2024-11-10 15:28:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:28:39,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:39,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495153573] [2024-11-10 15:28:39,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495153573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:39,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:39,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:39,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164394543] [2024-11-10 15:28:39,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:39,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:39,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:39,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:39,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:39,085 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:39,185 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-10 15:28:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:39,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 15:28:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:39,192 INFO L225 Difference]: With dead ends: 64 [2024-11-10 15:28:39,192 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 15:28:39,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:28:39,193 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:39,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 151 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 15:28:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 15:28:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-10 15:28:39,195 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 28 [2024-11-10 15:28:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:39,195 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-10 15:28:39,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-10 15:28:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:28:39,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:39,196 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:39,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:28:39,196 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:39,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash 896739103, now seen corresponding path program 1 times [2024-11-10 15:28:39,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:39,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142343597] [2024-11-10 15:28:39,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:39,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:39,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:39,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142343597] [2024-11-10 15:28:39,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142343597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:39,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:39,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:39,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535851840] [2024-11-10 15:28:39,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:39,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:39,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:39,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:39,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:39,356 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:39,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:39,442 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-11-10 15:28:39,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:39,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 15:28:39,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:39,443 INFO L225 Difference]: With dead ends: 64 [2024-11-10 15:28:39,443 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 15:28:39,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:28:39,443 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 26 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:39,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 176 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 15:28:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 15:28:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-11-10 15:28:39,445 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 28 [2024-11-10 15:28:39,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:39,446 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-11-10 15:28:39,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-11-10 15:28:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:28:39,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:39,446 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:39,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:28:39,446 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:39,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:39,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1799255965, now seen corresponding path program 1 times [2024-11-10 15:28:39,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:39,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636682335] [2024-11-10 15:28:39,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:39,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:39,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:39,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636682335] [2024-11-10 15:28:39,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636682335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:39,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20354072] [2024-11-10 15:28:39,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:39,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:39,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:39,878 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:39,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 15:28:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:39,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 15:28:39,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:39,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:40,022 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:40,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:28:40,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:28:40,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 15:28:40,079 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:28:40,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:28:40,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:28:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:40,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:40,318 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-10 15:28:40,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 15:28:40,977 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_578 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_576)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-11-10 15:28:40,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:40,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-10 15:28:40,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-10 15:28:40,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 15:28:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-10 15:28:41,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20354072] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:41,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:41,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2024-11-10 15:28:41,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112402673] [2024-11-10 15:28:41,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:41,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-10 15:28:41,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:41,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 15:28:41,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=775, Unknown=15, NotChecked=56, Total=930 [2024-11-10 15:28:41,065 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:41,632 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-11-10 15:28:41,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:28:41,632 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-10 15:28:41,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:41,634 INFO L225 Difference]: With dead ends: 85 [2024-11-10 15:28:41,634 INFO L226 Difference]: Without dead ends: 85 [2024-11-10 15:28:41,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=1428, Unknown=16, NotChecked=78, Total=1722 [2024-11-10 15:28:41,635 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 78 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:41,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 548 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 537 Invalid, 0 Unknown, 52 Unchecked, 0.3s Time] [2024-11-10 15:28:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-10 15:28:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2024-11-10 15:28:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 69 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2024-11-10 15:28:41,637 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 32 [2024-11-10 15:28:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:41,638 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2024-11-10 15:28:41,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2024-11-10 15:28:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:28:41,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:41,638 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:41,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:41,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:41,839 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:41,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1799255966, now seen corresponding path program 1 times [2024-11-10 15:28:41,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:41,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75146429] [2024-11-10 15:28:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:42,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:42,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75146429] [2024-11-10 15:28:42,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75146429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106012227] [2024-11-10 15:28:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:42,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:42,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:42,489 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:42,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 15:28:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:42,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-10 15:28:42,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:42,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:42,678 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:42,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:28:42,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:28:42,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:28:42,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 15:28:42,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 15:28:42,762 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:28:42,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-10 15:28:42,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-10 15:28:42,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-10 15:28:42,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-10 15:28:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:28:43,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:43,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:43,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2024-11-10 15:28:43,265 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_679 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_679) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))))) is different from false [2024-11-10 15:28:43,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_675 Int) (v_ArrVal_680 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 v_ArrVal_675)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_676 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse0 v_ArrVal_676)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (forall ((v_ArrVal_676 Int) (v_ArrVal_679 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse0 v_ArrVal_676)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_679) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))))) is different from false [2024-11-10 15:28:43,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:43,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-10 15:28:43,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-10 15:28:43,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 15:28:43,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:43,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-10 15:28:43,312 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:43,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 15:28:43,320 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-10 15:28:43,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2024-11-10 15:28:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-10 15:28:43,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106012227] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:43,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:43,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 35 [2024-11-10 15:28:43,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779707787] [2024-11-10 15:28:43,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:43,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 15:28:43,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:43,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 15:28:43,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1031, Unknown=2, NotChecked=130, Total=1260 [2024-11-10 15:28:43,447 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:44,311 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2024-11-10 15:28:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:28:44,312 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-10 15:28:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:44,312 INFO L225 Difference]: With dead ends: 101 [2024-11-10 15:28:44,312 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 15:28:44,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=220, Invalid=1766, Unknown=2, NotChecked=174, Total=2162 [2024-11-10 15:28:44,314 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 100 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:44,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 670 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 633 Invalid, 0 Unknown, 118 Unchecked, 0.4s Time] [2024-11-10 15:28:44,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 15:28:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 80. [2024-11-10 15:28:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2024-11-10 15:28:44,316 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 32 [2024-11-10 15:28:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:44,316 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2024-11-10 15:28:44,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2024-11-10 15:28:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:28:44,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:44,320 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:44,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:44,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:44,521 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:44,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:44,521 INFO L85 PathProgramCache]: Analyzing trace with hash 869050175, now seen corresponding path program 2 times [2024-11-10 15:28:44,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:44,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058000818] [2024-11-10 15:28:44,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:44,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:28:44,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:44,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058000818] [2024-11-10 15:28:44,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058000818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:44,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:44,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:44,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808184958] [2024-11-10 15:28:44,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:44,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:28:44,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:44,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:28:44,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:28:44,597 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:44,625 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2024-11-10 15:28:44,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:28:44,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-10 15:28:44,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:44,627 INFO L225 Difference]: With dead ends: 82 [2024-11-10 15:28:44,627 INFO L226 Difference]: Without dead ends: 82 [2024-11-10 15:28:44,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:28:44,628 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 53 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:44,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 130 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-10 15:28:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-11-10 15:28:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 79 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2024-11-10 15:28:44,633 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 36 [2024-11-10 15:28:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:44,634 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2024-11-10 15:28:44,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2024-11-10 15:28:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:28:44,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:44,634 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-10 15:28:44,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:28:44,635 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:44,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2051784822, now seen corresponding path program 1 times [2024-11-10 15:28:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7164566] [2024-11-10 15:28:44,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:44,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 15:28:44,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:44,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7164566] [2024-11-10 15:28:44,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7164566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:44,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961864221] [2024-11-10 15:28:44,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:44,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:44,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:44,725 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:44,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 15:28:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:44,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:28:44,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 15:28:44,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 15:28:44,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961864221] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:44,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:44,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 15:28:44,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219148927] [2024-11-10 15:28:44,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:44,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:44,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:44,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:44,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:44,948 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:44,966 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2024-11-10 15:28:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:28:44,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-10 15:28:44,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:44,967 INFO L225 Difference]: With dead ends: 84 [2024-11-10 15:28:44,967 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 15:28:44,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:28:44,969 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 107 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:44,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 100 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 15:28:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 15:28:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 83 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-11-10 15:28:44,975 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 42 [2024-11-10 15:28:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:44,976 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-11-10 15:28:44,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-11-10 15:28:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:28:44,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:44,976 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:28:44,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:45,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 15:28:45,178 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:45,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:45,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1525221661, now seen corresponding path program 1 times [2024-11-10 15:28:45,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:45,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595611702] [2024-11-10 15:28:45,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:45,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 15:28:45,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:45,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595611702] [2024-11-10 15:28:45,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595611702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:45,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839407102] [2024-11-10 15:28:45,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:45,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:45,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:45,259 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:45,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 15:28:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:45,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:28:45,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 15:28:45,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 15:28:45,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839407102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:45,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:45,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-10 15:28:45,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595238737] [2024-11-10 15:28:45,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:45,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:28:45,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:45,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:28:45,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:28:45,466 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:45,495 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2024-11-10 15:28:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:28:45,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-10 15:28:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:45,496 INFO L225 Difference]: With dead ends: 62 [2024-11-10 15:28:45,496 INFO L226 Difference]: Without dead ends: 62 [2024-11-10 15:28:45,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:28:45,496 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 44 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:45,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 126 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:28:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-10 15:28:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-10 15:28:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2024-11-10 15:28:45,498 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 42 [2024-11-10 15:28:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:45,498 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2024-11-10 15:28:45,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2024-11-10 15:28:45,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:28:45,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:45,499 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-10 15:28:45,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:45,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 15:28:45,704 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:45,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1004324122, now seen corresponding path program 2 times [2024-11-10 15:28:45,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:45,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871865062] [2024-11-10 15:28:45,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:45,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-10 15:28:45,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871865062] [2024-11-10 15:28:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871865062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:45,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:45,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:45,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599345410] [2024-11-10 15:28:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:45,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:45,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:45,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:45,797 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:45,869 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-11-10 15:28:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:45,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-10 15:28:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:45,870 INFO L225 Difference]: With dead ends: 64 [2024-11-10 15:28:45,870 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 15:28:45,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:28:45,870 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:45,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 107 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:45,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 15:28:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 15:28:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.152542372881356) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-11-10 15:28:45,872 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 48 [2024-11-10 15:28:45,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:45,872 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-11-10 15:28:45,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-11-10 15:28:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:28:45,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:45,872 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-10 15:28:45,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:28:45,873 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:45,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1004324123, now seen corresponding path program 1 times [2024-11-10 15:28:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:45,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7848944] [2024-11-10 15:28:45,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:45,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 15:28:46,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:46,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7848944] [2024-11-10 15:28:46,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7848944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:46,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:46,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:46,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092735407] [2024-11-10 15:28:46,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:46,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:46,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:46,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:46,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:46,027 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:46,104 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2024-11-10 15:28:46,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:46,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-10 15:28:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:46,105 INFO L225 Difference]: With dead ends: 66 [2024-11-10 15:28:46,105 INFO L226 Difference]: Without dead ends: 66 [2024-11-10 15:28:46,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:28:46,106 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:46,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 134 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-10 15:28:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-10 15:28:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2024-11-10 15:28:46,108 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 48 [2024-11-10 15:28:46,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:46,108 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2024-11-10 15:28:46,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2024-11-10 15:28:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:28:46,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:46,108 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-10 15:28:46,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:28:46,109 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:46,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:46,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1212199536, now seen corresponding path program 1 times [2024-11-10 15:28:46,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:46,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262127410] [2024-11-10 15:28:46,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:46,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 15:28:46,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:46,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262127410] [2024-11-10 15:28:46,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262127410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:46,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:46,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:28:46,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819686177] [2024-11-10 15:28:46,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:46,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:46,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:46,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:46,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:46,176 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:46,237 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-10 15:28:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:46,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-10 15:28:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:46,238 INFO L225 Difference]: With dead ends: 69 [2024-11-10 15:28:46,238 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 15:28:46,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:28:46,239 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:46,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 153 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:46,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 15:28:46,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2024-11-10 15:28:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 65 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2024-11-10 15:28:46,240 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 50 [2024-11-10 15:28:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:46,241 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2024-11-10 15:28:46,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2024-11-10 15:28:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 15:28:46,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:46,241 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-10 15:28:46,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:28:46,241 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:46,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:46,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1077728542, now seen corresponding path program 1 times [2024-11-10 15:28:46,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:46,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982237788] [2024-11-10 15:28:46,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:46,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 15:28:46,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:46,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982237788] [2024-11-10 15:28:46,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982237788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:28:46,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:28:46,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:28:46,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175036806] [2024-11-10 15:28:46,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:28:46,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:28:46,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:46,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:28:46,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:28:46,331 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:46,427 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2024-11-10 15:28:46,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:28:46,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-10 15:28:46,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:46,427 INFO L225 Difference]: With dead ends: 67 [2024-11-10 15:28:46,427 INFO L226 Difference]: Without dead ends: 67 [2024-11-10 15:28:46,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:28:46,428 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:46,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:28:46,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-10 15:28:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-10 15:28:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2024-11-10 15:28:46,429 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 51 [2024-11-10 15:28:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:46,430 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2024-11-10 15:28:46,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2024-11-10 15:28:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 15:28:46,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:46,431 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-10 15:28:46,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 15:28:46,431 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:46,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:46,431 INFO L85 PathProgramCache]: Analyzing trace with hash 805481119, now seen corresponding path program 1 times [2024-11-10 15:28:46,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:46,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230737625] [2024-11-10 15:28:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:46,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 15:28:47,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:47,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230737625] [2024-11-10 15:28:47,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230737625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:47,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503604637] [2024-11-10 15:28:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:47,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:47,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:47,337 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:47,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:28:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:47,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-10 15:28:47,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:47,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:47,539 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:47,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:28:47,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:28:47,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:28:47,615 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:28:47,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:28:47,748 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:28:47,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-10 15:28:47,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:47,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-10 15:28:47,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:47,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-10 15:28:47,962 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-10 15:28:47,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:28:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:47,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:48,966 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (forall ((v_ArrVal_1290 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|) (forall ((v_ArrVal_1291 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1290) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_ArrVal_1291) 4)))))) (forall ((v_ArrVal_1290 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int)) (or (forall ((v_ArrVal_1291 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1290) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_ArrVal_1291) 4)) 1)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))))) is different from false [2024-11-10 15:28:48,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:48,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 73 [2024-11-10 15:28:49,027 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_4) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_prenex_2)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_4 v_prenex_5) 4))))) (forall ((v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_ArrVal_1291 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|) (= (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1289))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1290)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_ArrVal_1291) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2024-11-10 15:28:49,061 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_ArrVal_1287 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_1287)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_prenex_2)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_4 v_prenex_5) 4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_4))) (forall ((v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1287 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_28| Int) (v_ArrVal_1291 Int)) (or (= (select (store (select (let ((.cse4 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 v_ArrVal_1287)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1289))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1290)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_28| v_ArrVal_1291) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_28|))))) is different from false [2024-11-10 15:28:49,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:49,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2024-11-10 15:28:49,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 277 [2024-11-10 15:28:49,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 215 [2024-11-10 15:28:49,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:49,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 226 [2024-11-10 15:28:49,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:49,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 223 [2024-11-10 15:28:49,161 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-10 15:28:49,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 1 [2024-11-10 15:28:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-10 15:28:49,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503604637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:49,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:49,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 21] total 43 [2024-11-10 15:28:49,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035792240] [2024-11-10 15:28:49,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:49,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-10 15:28:49,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:49,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-10 15:28:49,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1423, Unknown=76, NotChecked=240, Total=1892 [2024-11-10 15:28:49,228 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 44 states, 43 states have (on average 2.883720930232558) internal successors, (124), 44 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:50,140 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-11-10 15:28:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 15:28:50,141 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.883720930232558) internal successors, (124), 44 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-10 15:28:50,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:50,141 INFO L225 Difference]: With dead ends: 78 [2024-11-10 15:28:50,141 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 15:28:50,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 84 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=255, Invalid=2229, Unknown=78, NotChecked=300, Total=2862 [2024-11-10 15:28:50,143 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:50,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 449 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 901 Invalid, 0 Unknown, 193 Unchecked, 0.5s Time] [2024-11-10 15:28:50,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 15:28:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-11-10 15:28:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-10 15:28:50,144 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 56 [2024-11-10 15:28:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:50,144 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-10 15:28:50,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.883720930232558) internal successors, (124), 44 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-10 15:28:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 15:28:50,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:50,145 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-10 15:28:50,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:50,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-10 15:28:50,346 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:50,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:50,346 INFO L85 PathProgramCache]: Analyzing trace with hash 805481120, now seen corresponding path program 1 times [2024-11-10 15:28:50,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:50,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791165547] [2024-11-10 15:28:50,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:50,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:28:51,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:51,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791165547] [2024-11-10 15:28:51,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791165547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:51,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073430563] [2024-11-10 15:28:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:51,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:51,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:51,322 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:51,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 15:28:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:51,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-10 15:28:51,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:51,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:51,539 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:51,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:28:51,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:28:51,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:28:51,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:28:51,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:28:51,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 39 [2024-11-10 15:28:51,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-10 15:28:51,967 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:28:51,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-10 15:28:51,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-10 15:28:52,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:52,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-10 15:28:52,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:52,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:28:52,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:52,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-10 15:28:52,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:52,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-10 15:28:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:52,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:52,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1426 (Array Int Int))) (or (not (= v_ArrVal_1426 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1426 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1428 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1426) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1428)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (forall ((v_ArrVal_1426 (Array Int Int))) (or (not (= v_ArrVal_1426 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1426 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1426) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 5)))))) is different from false [2024-11-10 15:28:52,782 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1425 (Array Int Int)) (v_DerPreprocessor_2 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int)) (or (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_2) 4) 5)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|))) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (v_ArrVal_1428 Int) (v_DerPreprocessor_1 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_1) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_ArrVal_1428) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|)))) is different from false [2024-11-10 15:28:52,831 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (v_ArrVal_1428 Int) (v_DerPreprocessor_1 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_1) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_ArrVal_1428) 4))))) (forall ((v_ArrVal_1425 (Array Int Int)) (v_DerPreprocessor_2 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int)) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_2) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|)))) is different from false [2024-11-10 15:28:52,850 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (v_ArrVal_1428 Int) (v_DerPreprocessor_1 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1425) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_1) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1424) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_ArrVal_1428) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|))) (forall ((v_ArrVal_1425 (Array Int Int)) (v_DerPreprocessor_2 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1425) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_2) 4) 5)))))) is different from false [2024-11-10 15:28:52,895 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (v_ArrVal_1428 Int) (v_DerPreprocessor_1 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1425) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_1) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1424) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_ArrVal_1428) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|))) (forall ((v_ArrVal_1425 (Array Int Int)) (v_DerPreprocessor_2 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1425) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_2) 4))))))) is different from false [2024-11-10 15:28:52,930 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (and (forall ((v_ArrVal_1425 (Array Int Int)) (v_DerPreprocessor_2 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int)) (or (< 0 (+ 5 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1425) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_2) 4))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|))) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (v_ArrVal_1428 Int) (v_DerPreprocessor_1 Int)) (or (< (+ 7 (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1425) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_1) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1424) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_ArrVal_1428) 4))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|))))) is different from false [2024-11-10 15:28:52,952 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (and (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (v_ArrVal_1428 Int) (v_DerPreprocessor_1 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (< (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1425) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_1) 4) 7) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1424) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_ArrVal_1428) 4))))) (forall ((v_ArrVal_1425 (Array Int Int)) (v_DerPreprocessor_2 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1425) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_2) 4) 5)))))) is different from false [2024-11-10 15:28:53,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:53,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 127 [2024-11-10 15:28:53,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (v_ArrVal_1428 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_1421)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1424)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_ArrVal_1428) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (v_ArrVal_1421 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (v_DerPreprocessor_1 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (< (select (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1423) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_1421)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_1425) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_1) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)))) (forall ((v_DerPreprocessor_2 Int) (v_prenex_8 Int) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (or (< 0 (+ 5 (select (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_7) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_8)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_9 v_DerPreprocessor_2) 4))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_9))))) is different from false [2024-11-10 15:28:53,296 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1419 Int) (v_ArrVal_1418 Int) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (v_ArrVal_1421 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (v_DerPreprocessor_1 Int)) (or (< (select (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1418)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1423) (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse1 v_ArrVal_1419)))) (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_1421))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5) v_ArrVal_1425) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_DerPreprocessor_1) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|))) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_35| Int) (v_ArrVal_1428 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_35|) (= (select (store (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse1 v_ArrVal_1419)))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_1421))))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5) v_ArrVal_1424)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_35| v_ArrVal_1428) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_ArrVal_1419 Int) (v_ArrVal_1418 Int) (v_DerPreprocessor_2 Int) (v_prenex_8 Int) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_9) (< 0 (+ 5 (select (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1418)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_7) (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse1 v_ArrVal_1419)))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_prenex_8))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5) v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_9 v_DerPreprocessor_2) 4))))))) is different from false [2024-11-10 15:28:53,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:53,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 85 [2024-11-10 15:28:53,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 210 [2024-11-10 15:28:53,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2024-11-10 15:28:53,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2024-11-10 15:28:53,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:53,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 75 [2024-11-10 15:28:53,438 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:53,444 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-10 15:28:53,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2024-11-10 15:28:53,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:53,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 71 [2024-11-10 15:28:53,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:53,460 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:53,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-10 15:28:53,463 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:28:53,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-10 15:28:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2024-11-10 15:28:53,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073430563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:53,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:53,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 58 [2024-11-10 15:28:53,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000432041] [2024-11-10 15:28:53,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:53,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-10 15:28:53,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:53,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-10 15:28:53,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2250, Unknown=34, NotChecked=936, Total=3422 [2024-11-10 15:28:53,628 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 59 states, 58 states have (on average 2.7413793103448274) internal successors, (159), 59 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:54,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:54,821 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-10 15:28:54,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 15:28:54,822 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.7413793103448274) internal successors, (159), 59 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-10 15:28:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:54,822 INFO L225 Difference]: With dead ends: 80 [2024-11-10 15:28:54,822 INFO L226 Difference]: Without dead ends: 80 [2024-11-10 15:28:54,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=347, Invalid=3435, Unknown=36, NotChecked=1152, Total=4970 [2024-11-10 15:28:54,824 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 50 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 559 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:54,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 660 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 933 Invalid, 0 Unknown, 559 Unchecked, 0.5s Time] [2024-11-10 15:28:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-10 15:28:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-11-10 15:28:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-11-10 15:28:54,826 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 56 [2024-11-10 15:28:54,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:54,826 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-11-10 15:28:54,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.7413793103448274) internal successors, (159), 59 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:54,827 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-11-10 15:28:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 15:28:54,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:54,827 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-10 15:28:54,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-10 15:28:55,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-10 15:28:55,028 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:55,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:55,029 INFO L85 PathProgramCache]: Analyzing trace with hash 973202901, now seen corresponding path program 1 times [2024-11-10 15:28:55,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:55,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549081843] [2024-11-10 15:28:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:55,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:28:55,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:55,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549081843] [2024-11-10 15:28:55,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549081843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:55,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599484175] [2024-11-10 15:28:55,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:55,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:55,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:55,721 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:55,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 15:28:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:55,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-10 15:28:55,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:55,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:55,880 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:55,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:28:55,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:28:55,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:28:55,921 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:28:55,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-10 15:28:56,026 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:28:56,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-10 15:28:56,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:56,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-10 15:28:56,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:56,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2024-11-10 15:28:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:56,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:56,285 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1554 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1552) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_1554) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) is different from false [2024-11-10 15:28:56,345 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1554 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1552) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_1554) 4) 0)))) is different from false [2024-11-10 15:28:56,364 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1554 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1552) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_1554) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) is different from false [2024-11-10 15:28:56,378 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1554 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1552) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_1554) 4) 0)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) is different from false [2024-11-10 15:28:56,386 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1554 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1552) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_1554) 4) 0)))) is different from false [2024-11-10 15:28:56,405 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1554 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1552) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_1554) 4) 0)))) is different from false [2024-11-10 15:28:56,415 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1554 Int) (v_ArrVal_1551 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1551))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1552)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_1554) 4) 0)))) is different from false [2024-11-10 15:28:56,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:56,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2024-11-10 15:28:56,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 159 [2024-11-10 15:28:56,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:56,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 96 [2024-11-10 15:28:56,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:56,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 74 [2024-11-10 15:28:56,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2024-11-10 15:28:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-10 15:28:56,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599484175] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:56,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:56,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 23] total 46 [2024-11-10 15:28:56,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299466966] [2024-11-10 15:28:56,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:56,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-10 15:28:56,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:56,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-10 15:28:56,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1338, Unknown=13, NotChecked=560, Total=2070 [2024-11-10 15:28:56,713 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:28:57,495 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-10 15:28:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 15:28:57,496 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 15:28:57,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:28:57,496 INFO L225 Difference]: With dead ends: 83 [2024-11-10 15:28:57,496 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 15:28:57,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=352, Invalid=2733, Unknown=23, NotChecked=798, Total=3906 [2024-11-10 15:28:57,497 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 10 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 432 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:28:57,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 639 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 820 Invalid, 8 Unknown, 432 Unchecked, 0.3s Time] [2024-11-10 15:28:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 15:28:57,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2024-11-10 15:28:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 73 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2024-11-10 15:28:57,499 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 58 [2024-11-10 15:28:57,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:28:57,499 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-11-10 15:28:57,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:28:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2024-11-10 15:28:57,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 15:28:57,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:28:57,500 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-10 15:28:57,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-10 15:28:57,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-10 15:28:57,700 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:28:57,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:28:57,701 INFO L85 PathProgramCache]: Analyzing trace with hash 105727353, now seen corresponding path program 1 times [2024-11-10 15:28:57,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:28:57,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211517176] [2024-11-10 15:28:57,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:57,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:28:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:58,376 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:28:58,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:28:58,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211517176] [2024-11-10 15:28:58,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211517176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:28:58,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492829332] [2024-11-10 15:28:58,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:28:58,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:28:58,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:28:58,378 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:28:58,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 15:28:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:28:58,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-10 15:28:58,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:28:58,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:28:58,557 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:28:58,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:28:58,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:28:58,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:28:58,617 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:28:58,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:28:58,738 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:28:58,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:28:58,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:28:58,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-10 15:28:58,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:58,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-10 15:28:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:28:58,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:28:59,072 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1678 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1680) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-10 15:28:59,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1678 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1680) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))) is different from false [2024-11-10 15:28:59,183 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1678 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1678) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1680) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))) is different from false [2024-11-10 15:28:59,196 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1678 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1678) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1680) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-10 15:28:59,205 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1678 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1678) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1680) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-10 15:28:59,222 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1678 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1678) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1680) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))) is different from false [2024-11-10 15:28:59,231 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1677 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1677))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1678)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1680) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-10 15:28:59,246 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 Int) (v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1675 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1675)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1677))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1678)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1680) 4) |c_#StackHeapBarrier|))) is different from false [2024-11-10 15:28:59,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:59,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 46 [2024-11-10 15:28:59,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 154 [2024-11-10 15:28:59,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2024-11-10 15:28:59,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:59,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 68 [2024-11-10 15:28:59,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:28:59,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 63 [2024-11-10 15:28:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-10 15:28:59,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492829332] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:28:59,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:28:59,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 44 [2024-11-10 15:28:59,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678841816] [2024-11-10 15:28:59,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:28:59,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-10 15:28:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:28:59,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-10 15:28:59,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1192, Unknown=25, NotChecked=616, Total=1980 [2024-11-10 15:28:59,499 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 45 states, 44 states have (on average 3.022727272727273) internal successors, (133), 45 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:00,270 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2024-11-10 15:29:00,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 15:29:00,271 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.022727272727273) internal successors, (133), 45 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-10 15:29:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:00,271 INFO L225 Difference]: With dead ends: 81 [2024-11-10 15:29:00,271 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 15:29:00,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 93 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=249, Invalid=2014, Unknown=25, NotChecked=792, Total=3080 [2024-11-10 15:29:00,272 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 502 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:00,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 641 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 871 Invalid, 0 Unknown, 502 Unchecked, 0.4s Time] [2024-11-10 15:29:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 15:29:00,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2024-11-10 15:29:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2024-11-10 15:29:00,273 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 59 [2024-11-10 15:29:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:00,274 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2024-11-10 15:29:00,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.022727272727273) internal successors, (133), 45 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2024-11-10 15:29:00,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 15:29:00,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:00,274 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-10 15:29:00,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-10 15:29:00,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 15:29:00,475 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:00,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:00,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1845574436, now seen corresponding path program 2 times [2024-11-10 15:29:00,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:00,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209696133] [2024-11-10 15:29:00,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:00,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:29:01,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:01,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209696133] [2024-11-10 15:29:01,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209696133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:01,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269149647] [2024-11-10 15:29:01,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:29:01,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:01,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:01,908 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:29:01,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-10 15:29:02,071 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:29:02,072 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:29:02,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-10 15:29:02,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:02,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:29:02,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:29:02,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:29:02,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:02,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:02,193 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:29:02,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:29:02,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:29:02,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:29:02,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 15:29:02,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:29:02,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:29:02,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-10 15:29:02,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:02,372 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-10 15:29:02,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 66 [2024-11-10 15:29:02,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:02,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 15 [2024-11-10 15:29:02,716 INFO L349 Elim1Store]: treesize reduction 84, result has 40.8 percent of original size [2024-11-10 15:29:02,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 104 [2024-11-10 15:29:02,754 INFO L349 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2024-11-10 15:29:02,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 41 [2024-11-10 15:29:03,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:03,261 INFO L349 Elim1Store]: treesize reduction 104, result has 32.5 percent of original size [2024-11-10 15:29:03,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 114 treesize of output 124 [2024-11-10 15:29:03,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:03,304 INFO L349 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2024-11-10 15:29:03,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 94 [2024-11-10 15:29:04,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:29:04,871 INFO L349 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2024-11-10 15:29:04,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 110 [2024-11-10 15:29:04,912 INFO L349 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2024-11-10 15:29:04,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 97 [2024-11-10 15:29:04,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:04,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 66 [2024-11-10 15:29:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:29:05,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:05,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-10 15:29:06,632 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1825)) (.cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (< 0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= (select (select .cse1 .cse2) 4) 0) (not (= v_ArrVal_1825 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))) (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (= (select (select |c_#memory_$Pointer$#1.base| .cse6) 4) 0) (< 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1825) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (not (= v_ArrVal_1825 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))) (= |c_ULTIMATE.start_main_~s~0#1.base| .cse6))))))) is different from false [2024-11-10 15:29:06,683 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (or (not (= v_ArrVal_1825 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (< 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1825) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) (< .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1825)) (.cse6 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (or (= (select (select .cse5 .cse6) 4) 0) (not (= v_ArrVal_1825 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))) (< 0 (select (select .cse5 |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) (< .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (= .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|))))))) is different from false [2024-11-10 15:29:06,711 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse1 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1825))) (or (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select .cse1 .cse0) 4) 0) (< .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (not (= (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)) v_ArrVal_1825)) (< 0 (select (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (or (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse6) 4) 0) (< .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (not (= (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)) v_ArrVal_1825)) (< 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1825) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))))))) is different from false [2024-11-10 15:29:06,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse0 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1825))) (or (= (select (select .cse0 .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (not (= v_ArrVal_1825 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))) (< .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (< 0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse6) 4) 0) (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (not (= v_ArrVal_1825 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))) (< .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (< 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1825) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))))) is different from false [2024-11-10 15:29:06,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse6 .cse5 v_ArrVal_1817)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819))) (.cse3 (select (select (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (< (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (< 0 (select (select (store .cse0 .cse1 v_ArrVal_1825) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (not (= v_ArrVal_1825 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))) (= (select (select .cse2 .cse3) 4) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)))))) (forall ((v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse6 .cse5 v_ArrVal_1817)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse4 .cse5 v_ArrVal_1819))) (.cse9 (select (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse8 (store .cse7 .cse9 v_ArrVal_1825)) (.cse10 (select (select (store .cse11 .cse9 (store (select .cse11 .cse9) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (< (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (< 0 (select (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (not (= v_ArrVal_1825 (store (select .cse7 .cse9) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse10) (= (select (select .cse8 .cse10) 4) 0)))))))) is different from false [2024-11-10 15:29:06,945 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse8 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1815 Int) (v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse8 v_ArrVal_1815)))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_1817))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse2 (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1813))) (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_1819))))) (or (not (= (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)) v_ArrVal_1825)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (= (select (select .cse3 .cse2) 4) 0) (< (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (< 0 (select (select (store .cse0 .cse1 v_ArrVal_1825) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))))) (forall ((v_ArrVal_1815 Int) (v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse8 v_ArrVal_1815)))) (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_1817))))) (let ((.cse9 (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1813))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_1819)))) (.cse10 (select (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse11 (select (select (store .cse13 .cse10 (store (select .cse13 .cse10) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse12 (store .cse9 .cse10 v_ArrVal_1825))) (or (not (= (store (select .cse9 .cse10) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)) v_ArrVal_1825)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11) (= (select (select .cse12 .cse11) 4) 0) (< (select (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (< 0 (select (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))))))) is different from false [2024-11-10 15:29:09,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse8 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse9 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1815 Int) (v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse8 .cse9 v_ArrVal_1815)))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1817))))) (let ((.cse0 (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1813))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1819)))) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse3 (store .cse0 .cse1 v_ArrVal_1825)) (.cse2 (select (select (store .cse4 .cse1 (store (select .cse4 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= v_ArrVal_1825 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (< 0 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (= (select (select .cse3 .cse2) 4) 0) (< (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))))) (forall ((v_ArrVal_1815 Int) (v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse8 .cse9 v_ArrVal_1815)))) (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1817))))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse10 (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1813))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_1819)))) (.cse12 (select (select (store .cse13 .cse11 (store (select .cse13 .cse11) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= v_ArrVal_1825 (store (select .cse10 .cse11) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse12) (< 0 (select (select (store .cse10 .cse11 v_ArrVal_1825) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (< (select (select .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (= (select (select .cse13 .cse12) 4) 0)))))))) is different from false [2024-11-10 15:29:09,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:09,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 508 treesize of output 304 [2024-11-10 15:29:09,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:09,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 531 treesize of output 327 [2024-11-10 15:29:13,224 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1813 (Array Int Int)) (v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_1817 Int) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_13))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_1817))))) (let ((.cse1 (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1813))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_1819)))) (.cse2 (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1825)) (.cse3 (select (select (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (< 0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (not (= (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|)) v_ArrVal_1825)) (< (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (= (select (select .cse0 .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (not (= (select v_arrayElimArr_13 .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1817 Int) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_1819 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_59| Int) (v_ArrVal_1824 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse12 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_12))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_1817))))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse11 (select (select (store .cse12 .cse10 (store (select .cse12 .cse10) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| v_ArrVal_1824)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse9 (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1813))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_1819))))) (or (< 0 (select (select (store .cse9 .cse10 v_ArrVal_1825) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11) (< (select (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|) (= (select (select .cse12 .cse11) 4) 0) (not (= (select v_arrayElimArr_12 .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= v_ArrVal_1825 (store (select .cse9 .cse10) |v_ULTIMATE.start_dll_update_at_~head#1.offset_59| (select v_ArrVal_1825 |v_ULTIMATE.start_dll_update_at_~head#1.offset_59|))))))))))) is different from false [2024-11-10 15:29:34,901 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:34,989 INFO L349 Elim1Store]: treesize reduction 631, result has 46.4 percent of original size [2024-11-10 15:29:34,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 3299 treesize of output 3425 [2024-11-10 15:29:35,121 INFO L349 Elim1Store]: treesize reduction 22, result has 65.6 percent of original size [2024-11-10 15:29:35,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53342 treesize of output 34214 [2024-11-10 15:29:35,632 INFO L349 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2024-11-10 15:29:35,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 7885 treesize of output 7508 [2024-11-10 15:29:35,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6931 treesize of output 6405 [2024-11-10 15:29:36,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:36,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1527 treesize of output 1505 [2024-11-10 15:29:36,388 INFO L349 Elim1Store]: treesize reduction 73, result has 37.1 percent of original size [2024-11-10 15:29:36,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 899 treesize of output 926 [2024-11-10 15:29:37,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:37,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 8 [2024-11-10 15:29:37,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:37,727 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-10 15:29:37,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-11-10 15:29:37,758 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:37,781 INFO L349 Elim1Store]: treesize reduction 33, result has 28.3 percent of original size [2024-11-10 15:29:37,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2024-11-10 15:29:37,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:37,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 148 [2024-11-10 15:29:37,880 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-10 15:29:37,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 13 [2024-11-10 15:29:37,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:38,005 INFO L349 Elim1Store]: treesize reduction 78, result has 47.7 percent of original size [2024-11-10 15:29:38,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 125 treesize of output 190 [2024-11-10 15:29:38,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:38,235 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:38,240 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:38,241 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:38,282 INFO L349 Elim1Store]: treesize reduction 67, result has 45.1 percent of original size [2024-11-10 15:29:38,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 323 treesize of output 299 [2024-11-10 15:29:38,345 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:38,346 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:38,351 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-10 15:29:38,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 31 [2024-11-10 15:29:38,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:38,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:38,440 INFO L349 Elim1Store]: treesize reduction 139, result has 13.1 percent of original size [2024-11-10 15:29:38,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 304 treesize of output 246 [2024-11-10 15:29:38,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-10 15:29:38,741 INFO L349 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2024-11-10 15:29:38,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 220 treesize of output 218 [2024-11-10 15:29:39,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:39,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1654 treesize of output 1598 [2024-11-10 15:29:39,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:39,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 8 [2024-11-10 15:29:39,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-10 15:29:39,424 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:29:39,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:39,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 50 [2024-11-10 15:29:39,445 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,447 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,479 INFO L349 Elim1Store]: treesize reduction 22, result has 65.6 percent of original size [2024-11-10 15:29:39,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1432 treesize of output 1308 [2024-11-10 15:29:39,493 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-11-10 15:29:39,499 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:39,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 60 [2024-11-10 15:29:39,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2024-11-10 15:29:39,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:29:39,532 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-10 15:29:39,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:39,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 8 [2024-11-10 15:29:39,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:39,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-10 15:29:39,569 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,570 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,573 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,573 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:39,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1901 treesize of output 1775 [2024-11-10 15:29:39,588 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-10 15:29:39,592 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-10 15:29:39,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-10 15:29:39,605 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,607 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:29:39,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2024-11-10 15:29:39,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:29:39,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-10 15:29:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 14 not checked. [2024-11-10 15:29:39,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269149647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:29:39,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:29:39,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 68 [2024-11-10 15:29:39,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296255018] [2024-11-10 15:29:39,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:29:39,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-10 15:29:39,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:29:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-10 15:29:39,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=3306, Unknown=17, NotChecked=984, Total=4556 [2024-11-10 15:29:39,806 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 68 states, 68 states have (on average 2.3823529411764706) internal successors, (162), 68 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:29:43,100 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2024-11-10 15:29:43,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 15:29:43,101 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.3823529411764706) internal successors, (162), 68 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 15:29:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:29:43,101 INFO L225 Difference]: With dead ends: 128 [2024-11-10 15:29:43,101 INFO L226 Difference]: Without dead ends: 128 [2024-11-10 15:29:43,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=356, Invalid=4771, Unknown=17, NotChecked=1176, Total=6320 [2024-11-10 15:29:43,103 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 560 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:29:43,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1132 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1323 Invalid, 0 Unknown, 560 Unchecked, 1.7s Time] [2024-11-10 15:29:43,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-10 15:29:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2024-11-10 15:29:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.0743801652892562) internal successors, (130), 125 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2024-11-10 15:29:43,105 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 64 [2024-11-10 15:29:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:29:43,105 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2024-11-10 15:29:43,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.3823529411764706) internal successors, (162), 68 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:29:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2024-11-10 15:29:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 15:29:43,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:29:43,106 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-10 15:29:43,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-10 15:29:43,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:43,307 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2024-11-10 15:29:43,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:29:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash -224499430, now seen corresponding path program 2 times [2024-11-10 15:29:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:29:43,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745832667] [2024-11-10 15:29:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:29:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:29:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:29:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:29:44,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:29:44,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745832667] [2024-11-10 15:29:44,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745832667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:29:44,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575221960] [2024-11-10 15:29:44,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:29:44,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:29:44,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:29:44,173 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:29:44,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-10 15:29:44,317 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:29:44,317 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:29:44,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-10 15:29:44,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:29:44,377 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2024-11-10 15:29:44,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2024-11-10 15:29:44,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:29:44,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:29:44,525 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:29:44,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 46 [2024-11-10 15:29:44,842 INFO L349 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2024-11-10 15:29:44,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2024-11-10 15:29:44,851 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:29:44,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 28 [2024-11-10 15:29:45,045 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-10 15:29:45,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 59 [2024-11-10 15:29:45,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:45,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 59 [2024-11-10 15:29:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:29:45,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:29:46,127 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1953 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4) v_ArrVal_1953) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-10 15:29:46,132 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1953 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) v_ArrVal_1953) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-10 15:29:46,135 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1953 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) v_ArrVal_1953) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-10 15:29:46,141 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1953 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) v_ArrVal_1953) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-10 15:29:46,146 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1953 (Array Int Int)) (v_ArrVal_1952 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1952))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) v_ArrVal_1953)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-10 15:29:46,153 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1953 (Array Int Int)) (v_ArrVal_1952 (Array Int Int)) (v_ArrVal_1950 Int)) (= (store (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1950)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1952))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) v_ArrVal_1953)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-10 15:29:46,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:46,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 51 [2024-11-10 15:29:46,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:29:46,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 288 [2024-11-10 15:29:46,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 227 [2024-11-10 15:29:46,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 215 [2024-11-10 15:30:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 11 not checked. [2024-11-10 15:30:00,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575221960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:30:00,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:30:00,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 58 [2024-11-10 15:30:00,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257607744] [2024-11-10 15:30:00,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:30:00,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-10 15:30:00,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:30:00,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-10 15:30:00,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2575, Unknown=13, NotChecked=642, Total=3422 [2024-11-10 15:30:00,676 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand has 59 states, 58 states have (on average 2.9482758620689653) internal successors, (171), 59 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:30:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:30:02,582 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2024-11-10 15:30:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 15:30:02,582 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.9482758620689653) internal successors, (171), 59 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-10 15:30:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:30:02,582 INFO L225 Difference]: With dead ends: 129 [2024-11-10 15:30:02,583 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 15:30:02,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 94 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=283, Invalid=3760, Unknown=13, NotChecked=774, Total=4830 [2024-11-10 15:30:02,586 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 450 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:30:02,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 960 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1247 Invalid, 0 Unknown, 450 Unchecked, 1.1s Time] [2024-11-10 15:30:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 15:30:02,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 15:30:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 83 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:30:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2024-11-10 15:30:02,588 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 66 [2024-11-10 15:30:02,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:30:02,588 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2024-11-10 15:30:02,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.9482758620689653) internal successors, (171), 59 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:30:02,588 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2024-11-10 15:30:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 15:30:02,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:30:02,588 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 15:30:02,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0