./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/sll2c_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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:48:17,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:48:17,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:48:17,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:48:17,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:48:17,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:48:17,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:48:17,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:48:17,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:48:17,439 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:48:17,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:48:17,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:48:17,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:48:17,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:48:17,441 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:48:17,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:48:17,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:48:17,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:48:17,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:48:17,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:48:17,444 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:48:17,447 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:48:17,447 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:48:17,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:48:17,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:48:17,447 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:48:17,448 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:48:17,448 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:48:17,448 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:48:17,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:48:17,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:48:17,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:48:17,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:48:17,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:48:17,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:48:17,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:48:17,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:48:17,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:48:17,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:48:17,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:48:17,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:48:17,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:48:17,452 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2024-11-17 00:48:17,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:48:17,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:48:17,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:48:17,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:48:17,713 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:48:17,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2024-11-17 00:48:19,128 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:48:19,349 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:48:19,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2024-11-17 00:48:19,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1f94a6e/a7ca3229853340888ccc2ede05f6b01b/FLAG43835b6bf [2024-11-17 00:48:19,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1f94a6e/a7ca3229853340888ccc2ede05f6b01b [2024-11-17 00:48:19,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:48:19,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:48:19,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:48:19,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:48:19,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:48:19,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:19,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79ae602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19, skipping insertion in model container [2024-11-17 00:48:19,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:19,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:48:19,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:48:19,812 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:48:19,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:48:19,901 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:48:19,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19 WrapperNode [2024-11-17 00:48:19,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:48:19,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:48:19,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:48:19,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:48:19,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:19,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:19,960 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-11-17 00:48:19,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:48:19,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:48:19,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:48:19,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:48:19,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:19,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:19,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:20,007 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 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-17 00:48:20,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:20,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:20,021 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:20,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:20,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:20,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:20,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:48:20,038 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:48:20,038 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:48:20,038 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:48:20,039 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19" (1/1) ... [2024-11-17 00:48:20,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:48:20,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:20,071 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-17 00:48:20,073 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-17 00:48:20,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:48:20,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:48:20,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:48:20,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:48:20,117 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-17 00:48:20,117 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-17 00:48:20,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:48:20,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:48:20,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:48:20,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:48:20,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:48:20,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:48:20,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:48:20,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:48:20,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:48:20,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:48:20,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:48:20,232 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:48:20,235 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:48:20,464 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc sll_circular_get_data_at_#t~mem11#1; [2024-11-17 00:48:20,506 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-17 00:48:20,536 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-11-17 00:48:20,536 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:48:20,550 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:48:20,550 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:48:20,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:48:20 BoogieIcfgContainer [2024-11-17 00:48:20,550 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:48:20,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:48:20,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:48:20,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:48:20,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:48:19" (1/3) ... [2024-11-17 00:48:20,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eca1d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:48:20, skipping insertion in model container [2024-11-17 00:48:20,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:48:19" (2/3) ... [2024-11-17 00:48:20,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eca1d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:48:20, skipping insertion in model container [2024-11-17 00:48:20,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:48:20" (3/3) ... [2024-11-17 00:48:20,562 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2024-11-17 00:48:20,581 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:48:20,581 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-11-17 00:48:20,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:48:20,646 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;@4b76a567, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:48:20,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-11-17 00:48:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 90 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:20,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:48:20,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:20,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:48:20,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:20,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:20,668 INFO L85 PathProgramCache]: Analyzing trace with hash -271990698, now seen corresponding path program 1 times [2024-11-17 00:48:20,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:20,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537439886] [2024-11-17 00:48:20,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:20,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:20,919 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-17 00:48:20,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:20,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537439886] [2024-11-17 00:48:20,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537439886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:20,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:20,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:48:20,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611151094] [2024-11-17 00:48:20,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:20,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:48:20,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:20,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:48:20,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:48:20,964 INFO L87 Difference]: Start difference. First operand has 94 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 90 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-17 00:48:21,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:21,065 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2024-11-17 00:48:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:48:21,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 6 [2024-11-17 00:48:21,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:21,075 INFO L225 Difference]: With dead ends: 91 [2024-11-17 00:48:21,076 INFO L226 Difference]: Without dead ends: 87 [2024-11-17 00:48:21,077 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-17 00:48:21,080 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:21,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 156 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-17 00:48:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-17 00:48:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 83 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2024-11-17 00:48:21,156 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 6 [2024-11-17 00:48:21,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:21,157 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2024-11-17 00:48:21,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-17 00:48:21,158 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-11-17 00:48:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:48:21,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:21,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:48:21,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:48:21,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:21,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:21,161 INFO L85 PathProgramCache]: Analyzing trace with hash -271990697, now seen corresponding path program 1 times [2024-11-17 00:48:21,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:21,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239045005] [2024-11-17 00:48:21,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:21,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:21,269 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-17 00:48:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:21,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239045005] [2024-11-17 00:48:21,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239045005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:21,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:21,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:48:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404646193] [2024-11-17 00:48:21,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:21,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:48:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:21,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:48:21,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:48:21,277 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-17 00:48:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:21,339 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-11-17 00:48:21,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:48:21,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 6 [2024-11-17 00:48:21,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:21,341 INFO L225 Difference]: With dead ends: 85 [2024-11-17 00:48:21,342 INFO L226 Difference]: Without dead ends: 85 [2024-11-17 00:48:21,342 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-17 00:48:21,344 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:21,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 158 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-17 00:48:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-17 00:48:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-11-17 00:48:21,354 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 6 [2024-11-17 00:48:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:21,354 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-11-17 00:48:21,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-17 00:48:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-11-17 00:48:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 00:48:21,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:21,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:21,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:48:21,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:21,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:21,360 INFO L85 PathProgramCache]: Analyzing trace with hash 105901198, now seen corresponding path program 1 times [2024-11-17 00:48:21,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:21,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155437923] [2024-11-17 00:48:21,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:21,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:21,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:21,531 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-17 00:48:21,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:21,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155437923] [2024-11-17 00:48:21,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155437923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:21,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:21,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:48:21,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924799527] [2024-11-17 00:48:21,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:21,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:48:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:21,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:48:21,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:48:21,538 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:48:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:21,640 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-11-17 00:48:21,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:48:21,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-17 00:48:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:21,641 INFO L225 Difference]: With dead ends: 93 [2024-11-17 00:48:21,642 INFO L226 Difference]: Without dead ends: 93 [2024-11-17 00:48:21,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:48:21,644 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:21,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-17 00:48:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2024-11-17 00:48:21,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5) internal successors, (90), 83 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2024-11-17 00:48:21,657 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 14 [2024-11-17 00:48:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:21,657 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2024-11-17 00:48:21,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:48:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-11-17 00:48:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:48:21,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:21,661 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:21,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:48:21,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:21,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1341879771, now seen corresponding path program 1 times [2024-11-17 00:48:21,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:21,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312469782] [2024-11-17 00:48:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:21,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:21,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:48:22,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:22,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312469782] [2024-11-17 00:48:22,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312469782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:22,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:22,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:48:22,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931701526] [2024-11-17 00:48:22,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:22,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:48:22,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:22,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:48:22,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:22,043 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:22,181 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2024-11-17 00:48:22,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:22,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-17 00:48:22,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:22,183 INFO L225 Difference]: With dead ends: 86 [2024-11-17 00:48:22,183 INFO L226 Difference]: Without dead ends: 86 [2024-11-17 00:48:22,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:22,184 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:22,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 385 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:22,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-17 00:48:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-17 00:48:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 82 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2024-11-17 00:48:22,194 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 23 [2024-11-17 00:48:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:22,195 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2024-11-17 00:48:22,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-11-17 00:48:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 00:48:22,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:22,196 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:22,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:48:22,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:22,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1341879772, now seen corresponding path program 1 times [2024-11-17 00:48:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:22,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822715294] [2024-11-17 00:48:22,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:22,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:22,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:48:22,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:22,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822715294] [2024-11-17 00:48:22,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822715294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:22,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:22,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:48:22,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865084449] [2024-11-17 00:48:22,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:22,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:48:22,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:22,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:48:22,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:22,438 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:22,570 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-11-17 00:48:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:22,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-17 00:48:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:22,572 INFO L225 Difference]: With dead ends: 85 [2024-11-17 00:48:22,572 INFO L226 Difference]: Without dead ends: 85 [2024-11-17 00:48:22,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:22,573 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:22,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 355 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-17 00:48:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-17 00:48:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-11-17 00:48:22,583 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 23 [2024-11-17 00:48:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:22,584 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-11-17 00:48:22,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-11-17 00:48:22,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:48:22,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:22,586 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:22,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:48:22,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:22,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:22,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1463251293, now seen corresponding path program 1 times [2024-11-17 00:48:22,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:22,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066028555] [2024-11-17 00:48:22,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:22,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:22,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:22,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:48:22,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:22,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066028555] [2024-11-17 00:48:22,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066028555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:22,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301108798] [2024-11-17 00:48:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:22,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:22,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:22,895 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-17 00:48:22,896 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-17 00:48:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:23,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 00:48:23,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:23,073 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-17 00:48:23,143 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-17 00:48:23,228 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 00:48:23,229 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-17 00:48:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2024-11-17 00:48:23,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:23,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301108798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:23,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:23,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-11-17 00:48:23,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122066896] [2024-11-17 00:48:23,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:23,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:48:23,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:23,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:48:23,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-17 00:48:23,331 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:48:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:23,565 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2024-11-17 00:48:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:23,566 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-17 00:48:23,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:23,567 INFO L225 Difference]: With dead ends: 84 [2024-11-17 00:48:23,567 INFO L226 Difference]: Without dead ends: 84 [2024-11-17 00:48:23,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-11-17 00:48:23,568 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:23,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 459 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2024-11-17 00:48:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-17 00:48:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-17 00:48:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.45) internal successors, (87), 80 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2024-11-17 00:48:23,582 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 27 [2024-11-17 00:48:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:23,582 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2024-11-17 00:48:23,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:48:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-11-17 00:48:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:48:23,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:23,584 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:23,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 00:48:23,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-17 00:48:23,785 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:23,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:23,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1463251292, now seen corresponding path program 1 times [2024-11-17 00:48:23,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:23,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911371610] [2024-11-17 00:48:23,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:23,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:24,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:24,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:48:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911371610] [2024-11-17 00:48:24,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911371610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:24,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699887328] [2024-11-17 00:48:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:24,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:24,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:24,267 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-17 00:48:24,269 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-17 00:48:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:24,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-17 00:48:24,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:24,404 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-17 00:48:24,410 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-17 00:48:24,550 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-17 00:48:24,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:24,589 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-17 00:48:24,597 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:48:24,597 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-17 00:48:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-17 00:48:24,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:24,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699887328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:24,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:24,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2024-11-17 00:48:24,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017049353] [2024-11-17 00:48:24,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:24,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 00:48:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:24,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 00:48:24,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2024-11-17 00:48:24,747 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:25,019 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2024-11-17 00:48:25,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:48:25,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-11-17 00:48:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:25,022 INFO L225 Difference]: With dead ends: 92 [2024-11-17 00:48:25,022 INFO L226 Difference]: Without dead ends: 92 [2024-11-17 00:48:25,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-11-17 00:48:25,023 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:25,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 584 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 289 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2024-11-17 00:48:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-17 00:48:25,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-17 00:48:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 86 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:48:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-11-17 00:48:25,032 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 27 [2024-11-17 00:48:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:25,032 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-11-17 00:48:25,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-11-17 00:48:25,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 00:48:25,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:25,033 INFO L215 NwaCegarLoop]: trace histogram [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-17 00:48:25,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 00:48:25,237 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,SelfDestructingSolverStorable6 [2024-11-17 00:48:25,238 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:25,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:25,238 INFO L85 PathProgramCache]: Analyzing trace with hash 116358634, now seen corresponding path program 1 times [2024-11-17 00:48:25,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:25,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303052116] [2024-11-17 00:48:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:25,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:25,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:48:25,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:25,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303052116] [2024-11-17 00:48:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303052116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:25,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:48:25,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407742390] [2024-11-17 00:48:25,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:25,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:48:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:25,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:48:25,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:25,497 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:25,731 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2024-11-17 00:48:25,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:48:25,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-17 00:48:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:25,733 INFO L225 Difference]: With dead ends: 95 [2024-11-17 00:48:25,734 INFO L226 Difference]: Without dead ends: 95 [2024-11-17 00:48:25,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:48:25,735 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 45 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:25,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 499 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:48:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-17 00:48:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-17 00:48:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 90 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:48:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-11-17 00:48:25,745 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 34 [2024-11-17 00:48:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:25,745 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-11-17 00:48:25,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-11-17 00:48:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 00:48:25,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:25,746 INFO L215 NwaCegarLoop]: trace histogram [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-17 00:48:25,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:48:25,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:25,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash 116358635, now seen corresponding path program 1 times [2024-11-17 00:48:25,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:25,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039100601] [2024-11-17 00:48:25,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:25,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:25,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 00:48:25,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:25,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039100601] [2024-11-17 00:48:25,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039100601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:25,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:25,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:48:25,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858207703] [2024-11-17 00:48:25,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:25,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:48:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:25,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:48:25,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:48:25,862 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:25,973 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2024-11-17 00:48:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:25,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-17 00:48:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:25,975 INFO L225 Difference]: With dead ends: 128 [2024-11-17 00:48:25,975 INFO L226 Difference]: Without dead ends: 128 [2024-11-17 00:48:25,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:48:25,976 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 140 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:25,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 288 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-17 00:48:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 101. [2024-11-17 00:48:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 96 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:48:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2024-11-17 00:48:25,981 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 34 [2024-11-17 00:48:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:25,982 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2024-11-17 00:48:25,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:25,982 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2024-11-17 00:48:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 00:48:25,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:25,983 INFO L215 NwaCegarLoop]: trace histogram [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-17 00:48:25,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:48:25,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:25,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:25,983 INFO L85 PathProgramCache]: Analyzing trace with hash 116358670, now seen corresponding path program 1 times [2024-11-17 00:48:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:25,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769036267] [2024-11-17 00:48:25,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:25,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:26,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:26,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:48:26,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:26,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769036267] [2024-11-17 00:48:26,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769036267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:26,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:26,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:48:26,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969116343] [2024-11-17 00:48:26,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:26,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:48:26,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:26,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:48:26,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:26,305 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:26,524 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2024-11-17 00:48:26,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:48:26,524 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-17 00:48:26,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:26,525 INFO L225 Difference]: With dead ends: 101 [2024-11-17 00:48:26,525 INFO L226 Difference]: Without dead ends: 101 [2024-11-17 00:48:26,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:48:26,526 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 40 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:26,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 572 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:48:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-17 00:48:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-17 00:48:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.381578947368421) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:48:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2024-11-17 00:48:26,531 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 34 [2024-11-17 00:48:26,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:26,531 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2024-11-17 00:48:26,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2024-11-17 00:48:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-17 00:48:26,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:26,537 INFO L215 NwaCegarLoop]: trace histogram [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-17 00:48:26,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:48:26,537 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:26,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:26,539 INFO L85 PathProgramCache]: Analyzing trace with hash -406062772, now seen corresponding path program 1 times [2024-11-17 00:48:26,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:26,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476313858] [2024-11-17 00:48:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:26,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:26,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:48:27,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:27,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476313858] [2024-11-17 00:48:27,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476313858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:27,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585463928] [2024-11-17 00:48:27,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:27,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:27,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:27,146 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-17 00:48:27,147 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-17 00:48:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:27,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-17 00:48:27,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:27,281 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-17 00:48:27,393 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:48:27,393 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-17 00:48:27,403 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-17 00:48:27,427 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:27,428 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-17 00:48:27,574 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 25 treesize of output 13 [2024-11-17 00:48:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:48:27,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:27,609 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-17 00:48:27,609 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 19 treesize of output 18 [2024-11-17 00:48:27,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_662) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-11-17 00:48:27,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:27,673 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 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-17 00:48:27,678 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 30 treesize of output 22 [2024-11-17 00:48:27,682 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 5 treesize of output 3 [2024-11-17 00:48:27,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585463928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:27,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:27,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 26 [2024-11-17 00:48:27,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575431312] [2024-11-17 00:48:27,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:27,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-17 00:48:27,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-17 00:48:27,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=739, Unknown=11, NotChecked=54, Total=870 [2024-11-17 00:48:27,752 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 23 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:48:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:28,366 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2024-11-17 00:48:28,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 00:48:28,367 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 23 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-17 00:48:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:28,369 INFO L225 Difference]: With dead ends: 123 [2024-11-17 00:48:28,369 INFO L226 Difference]: Without dead ends: 123 [2024-11-17 00:48:28,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=1022, Unknown=11, NotChecked=64, Total=1190 [2024-11-17 00:48:28,370 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:28,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1513 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:48:28,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-17 00:48:28,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2024-11-17 00:48:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 108 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:48:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2024-11-17 00:48:28,375 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 38 [2024-11-17 00:48:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:28,376 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2024-11-17 00:48:28,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 23 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:48:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2024-11-17 00:48:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-17 00:48:28,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:28,380 INFO L215 NwaCegarLoop]: trace histogram [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-17 00:48:28,397 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-17 00:48:28,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:28,585 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:28,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash -406062771, now seen corresponding path program 1 times [2024-11-17 00:48:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:28,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020671573] [2024-11-17 00:48:28,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:28,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:29,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:29,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:48:29,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020671573] [2024-11-17 00:48:29,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020671573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016855137] [2024-11-17 00:48:29,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:29,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:29,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:29,330 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-17 00:48:29,332 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-17 00:48:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:29,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-17 00:48:29,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:29,487 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-17 00:48:29,493 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-17 00:48:29,760 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:48:29,760 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 14 treesize of output 13 [2024-11-17 00:48:29,776 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:48:29,776 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-17 00:48:29,867 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-17 00:48:29,876 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-17 00:48:30,007 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:30,008 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-17 00:48:30,016 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-17 00:48:30,235 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 25 treesize of output 13 [2024-11-17 00:48:30,240 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 7 treesize of output 3 [2024-11-17 00:48:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:48:30,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:30,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:30,802 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 1 case distinctions, treesize of input 37 treesize of output 38 [2024-11-17 00:48:30,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:30,809 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 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-17 00:48:30,814 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 52 treesize of output 44 [2024-11-17 00:48:30,819 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 82 treesize of output 70 [2024-11-17 00:48:30,825 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 9 [2024-11-17 00:48:30,828 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 9 treesize of output 7 [2024-11-17 00:48:30,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:30,838 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 1 case distinctions, treesize of input 20 treesize of output 21 [2024-11-17 00:48:30,840 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:30,842 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 18 treesize of output 10 [2024-11-17 00:48:31,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016855137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:31,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:31,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2024-11-17 00:48:31,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665472696] [2024-11-17 00:48:31,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:31,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-17 00:48:31,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:31,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-17 00:48:31,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1991, Unknown=40, NotChecked=0, Total=2162 [2024-11-17 00:48:31,021 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 30 states have internal predecessors, (63), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:48:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:31,855 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2024-11-17 00:48:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 00:48:31,855 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 30 states have internal predecessors, (63), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2024-11-17 00:48:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:31,857 INFO L225 Difference]: With dead ends: 123 [2024-11-17 00:48:31,857 INFO L226 Difference]: Without dead ends: 123 [2024-11-17 00:48:31,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=186, Invalid=2739, Unknown=45, NotChecked=0, Total=2970 [2024-11-17 00:48:31,859 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 40 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:31,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1645 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:48:31,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-17 00:48:31,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2024-11-17 00:48:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 104 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:48:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2024-11-17 00:48:31,866 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 38 [2024-11-17 00:48:31,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:31,866 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2024-11-17 00:48:31,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 30 states have internal predecessors, (63), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:48:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2024-11-17 00:48:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-17 00:48:31,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:31,870 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:31,888 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-17 00:48:32,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:32,071 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:32,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1441220945, now seen corresponding path program 2 times [2024-11-17 00:48:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:32,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733000883] [2024-11-17 00:48:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:32,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:32,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:32,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-17 00:48:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-17 00:48:32,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:32,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733000883] [2024-11-17 00:48:32,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733000883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:32,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232486611] [2024-11-17 00:48:32,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:48:32,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:32,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:32,171 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-17 00:48:32,172 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-17 00:48:32,313 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:48:32,314 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:48:32,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:48:32,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-17 00:48:32,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:48:32,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232486611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:32,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:48:32,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-17 00:48:32,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566466829] [2024-11-17 00:48:32,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:32,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:48:32,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:32,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:48:32,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:48:32,342 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:48:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:32,361 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-11-17 00:48:32,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:48:32,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-17 00:48:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:32,362 INFO L225 Difference]: With dead ends: 95 [2024-11-17 00:48:32,362 INFO L226 Difference]: Without dead ends: 95 [2024-11-17 00:48:32,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:48:32,362 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:32,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:48:32,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-17 00:48:32,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-17 00:48:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 91 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-17 00:48:32,365 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 40 [2024-11-17 00:48:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:32,366 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-17 00:48:32,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:48:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-17 00:48:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-17 00:48:32,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:32,366 INFO L215 NwaCegarLoop]: trace histogram [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-17 00:48:32,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-17 00:48:32,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-17 00:48:32,568 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:32,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:32,568 INFO L85 PathProgramCache]: Analyzing trace with hash -984091730, now seen corresponding path program 2 times [2024-11-17 00:48:32,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:32,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874910888] [2024-11-17 00:48:32,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:32,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:32,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:32,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 00:48:32,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:32,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874910888] [2024-11-17 00:48:32,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874910888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:32,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:32,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:48:32,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350596401] [2024-11-17 00:48:32,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:32,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:48:32,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:32,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:48:32,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:32,677 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:32,765 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2024-11-17 00:48:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:32,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-11-17 00:48:32,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:32,766 INFO L225 Difference]: With dead ends: 115 [2024-11-17 00:48:32,766 INFO L226 Difference]: Without dead ends: 115 [2024-11-17 00:48:32,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:48:32,767 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 120 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:32,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 367 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-17 00:48:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2024-11-17 00:48:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 93 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2024-11-17 00:48:32,770 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 42 [2024-11-17 00:48:32,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:32,771 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2024-11-17 00:48:32,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2024-11-17 00:48:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-17 00:48:32,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:32,772 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:32,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:48:32,773 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:32,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1965087414, now seen corresponding path program 1 times [2024-11-17 00:48:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:32,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182621964] [2024-11-17 00:48:32,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:32,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:32,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 00:48:32,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182621964] [2024-11-17 00:48:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182621964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801623872] [2024-11-17 00:48:32,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:32,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:32,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:32,883 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-17 00:48:32,885 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-17 00:48:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:33,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:48:33,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 00:48:33,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 00:48:33,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801623872] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:48:33,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:48:33,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-17 00:48:33,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473450853] [2024-11-17 00:48:33,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:33,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:48:33,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:33,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:48:33,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:48:33,171 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:33,251 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2024-11-17 00:48:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:48:33,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2024-11-17 00:48:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:33,252 INFO L225 Difference]: With dead ends: 119 [2024-11-17 00:48:33,252 INFO L226 Difference]: Without dead ends: 119 [2024-11-17 00:48:33,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:48:33,253 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 245 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:33,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 345 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-17 00:48:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2024-11-17 00:48:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2024-11-17 00:48:33,258 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 47 [2024-11-17 00:48:33,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:33,258 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2024-11-17 00:48:33,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2024-11-17 00:48:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 00:48:33,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:33,259 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-17 00:48:33,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-17 00:48:33,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-17 00:48:33,460 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:33,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:33,461 INFO L85 PathProgramCache]: Analyzing trace with hash -72638606, now seen corresponding path program 1 times [2024-11-17 00:48:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:33,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565904353] [2024-11-17 00:48:33,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:33,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:33,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:33,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 00:48:33,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:33,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565904353] [2024-11-17 00:48:33,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565904353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:33,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021648855] [2024-11-17 00:48:33,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:33,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:33,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:33,575 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-17 00:48:33,576 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-17 00:48:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:33,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:48:33,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 00:48:33,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 00:48:33,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021648855] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:48:33,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:48:33,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2024-11-17 00:48:33,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678194036] [2024-11-17 00:48:33,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:33,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:48:33,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:33,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:48:33,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:48:33,837 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:33,934 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2024-11-17 00:48:33,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:33,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2024-11-17 00:48:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:33,936 INFO L225 Difference]: With dead ends: 109 [2024-11-17 00:48:33,936 INFO L226 Difference]: Without dead ends: 109 [2024-11-17 00:48:33,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:48:33,937 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 216 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:33,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 447 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:33,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-17 00:48:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2024-11-17 00:48:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 97 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2024-11-17 00:48:33,940 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 48 [2024-11-17 00:48:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:33,940 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2024-11-17 00:48:33,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2024-11-17 00:48:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-17 00:48:33,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:33,941 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-17 00:48:33,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-17 00:48:34,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:34,145 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:34,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:34,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1804874758, now seen corresponding path program 2 times [2024-11-17 00:48:34,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031990870] [2024-11-17 00:48:34,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:34,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:34,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:34,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-17 00:48:34,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:34,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031990870] [2024-11-17 00:48:34,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031990870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:34,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:34,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:48:34,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464689241] [2024-11-17 00:48:34,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:34,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:48:34,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:34,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:48:34,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:34,342 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:34,526 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2024-11-17 00:48:34,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:48:34,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2024-11-17 00:48:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:34,527 INFO L225 Difference]: With dead ends: 109 [2024-11-17 00:48:34,527 INFO L226 Difference]: Without dead ends: 109 [2024-11-17 00:48:34,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:48:34,528 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 28 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:34,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 464 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:48:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-17 00:48:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-17 00:48:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 105 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2024-11-17 00:48:34,532 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 53 [2024-11-17 00:48:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:34,533 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2024-11-17 00:48:34,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2024-11-17 00:48:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-17 00:48:34,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:34,534 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-17 00:48:34,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:48:34,535 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:34,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:34,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1804874759, now seen corresponding path program 1 times [2024-11-17 00:48:34,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:34,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839645842] [2024-11-17 00:48:34,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:34,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:34,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:34,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-17 00:48:34,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:34,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839645842] [2024-11-17 00:48:34,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839645842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:34,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406024391] [2024-11-17 00:48:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:34,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:34,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:34,709 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-17 00:48:34,710 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-17 00:48:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:34,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:48:34,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:48:34,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:48:34,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406024391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:34,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:48:34,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-17 00:48:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079114175] [2024-11-17 00:48:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:34,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:48:34,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:34,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:48:34,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:34,939 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:34,981 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2024-11-17 00:48:34,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:48:34,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2024-11-17 00:48:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:34,982 INFO L225 Difference]: With dead ends: 116 [2024-11-17 00:48:34,982 INFO L226 Difference]: Without dead ends: 116 [2024-11-17 00:48:34,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:48:34,982 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 107 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:34,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 227 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:48:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-17 00:48:34,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2024-11-17 00:48:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2024-11-17 00:48:34,985 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 53 [2024-11-17 00:48:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:34,986 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2024-11-17 00:48:34,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2024-11-17 00:48:34,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-17 00:48:34,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:34,987 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-17 00:48:35,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-17 00:48:35,191 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,SelfDestructingSolverStorable17 [2024-11-17 00:48:35,192 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:35,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:35,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1804874794, now seen corresponding path program 1 times [2024-11-17 00:48:35,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:35,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916322732] [2024-11-17 00:48:35,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:35,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:35,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 00:48:35,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916322732] [2024-11-17 00:48:35,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916322732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:35,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:35,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:48:35,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504533918] [2024-11-17 00:48:35,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:35,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:48:35,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:35,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:48:35,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:35,484 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:35,680 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2024-11-17 00:48:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:48:35,681 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2024-11-17 00:48:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:35,683 INFO L225 Difference]: With dead ends: 108 [2024-11-17 00:48:35,683 INFO L226 Difference]: Without dead ends: 108 [2024-11-17 00:48:35,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:48:35,684 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 23 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:35,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 545 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:48:35,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-17 00:48:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-17 00:48:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.303370786516854) internal successors, (116), 104 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2024-11-17 00:48:35,689 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 53 [2024-11-17 00:48:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:35,693 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2024-11-17 00:48:35,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2024-11-17 00:48:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-17 00:48:35,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:35,694 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-17 00:48:35,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:48:35,695 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:35,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:35,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1621578920, now seen corresponding path program 1 times [2024-11-17 00:48:35,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:35,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858700467] [2024-11-17 00:48:35,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:35,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:36,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:36,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:48:36,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:36,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858700467] [2024-11-17 00:48:36,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858700467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:36,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879480751] [2024-11-17 00:48:36,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:36,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:36,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:36,644 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-17 00:48:36,645 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-17 00:48:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:36,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-17 00:48:36,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:36,854 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-17 00:48:36,970 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:48:36,971 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-17 00:48:37,034 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-17 00:48:37,115 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:37,116 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 25 treesize of output 26 [2024-11-17 00:48:37,322 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:37,322 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-17 00:48:37,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:37,443 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 37 treesize of output 17 [2024-11-17 00:48:37,517 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 25 treesize of output 13 [2024-11-17 00:48:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:48:37,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:37,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1668 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1668) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1668 .cse0))) v_ArrVal_1668)))) is different from false [2024-11-17 00:48:37,615 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-17 00:48:37,615 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 19 treesize of output 18 [2024-11-17 00:48:37,666 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1667) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-17 00:48:37,671 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1667) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) is different from false [2024-11-17 00:48:37,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1666 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1666) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-17 00:48:37,732 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1666 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1666) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-17 00:48:37,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:37,758 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 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-17 00:48:37,760 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 33 treesize of output 25 [2024-11-17 00:48:37,763 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 6 treesize of output 4 [2024-11-17 00:48:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2024-11-17 00:48:38,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879480751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:48:38,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:48:38,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 53 [2024-11-17 00:48:38,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941859471] [2024-11-17 00:48:38,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:38,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-17 00:48:38,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:38,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-17 00:48:38,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2207, Unknown=16, NotChecked=490, Total=2862 [2024-11-17 00:48:38,068 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 54 states, 53 states have (on average 2.2641509433962264) internal successors, (120), 46 states have internal predecessors, (120), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:48:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:39,128 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2024-11-17 00:48:39,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-17 00:48:39,128 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.2641509433962264) internal successors, (120), 46 states have internal predecessors, (120), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2024-11-17 00:48:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:39,129 INFO L225 Difference]: With dead ends: 118 [2024-11-17 00:48:39,129 INFO L226 Difference]: Without dead ends: 118 [2024-11-17 00:48:39,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 83 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=230, Invalid=3196, Unknown=16, NotChecked=590, Total=4032 [2024-11-17 00:48:39,131 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 54 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:39,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1959 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1268 Invalid, 0 Unknown, 346 Unchecked, 0.6s Time] [2024-11-17 00:48:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-17 00:48:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-17 00:48:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 114 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2024-11-17 00:48:39,134 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 57 [2024-11-17 00:48:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:39,134 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2024-11-17 00:48:39,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.2641509433962264) internal successors, (120), 46 states have internal predecessors, (120), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:48:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2024-11-17 00:48:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-17 00:48:39,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:39,135 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-17 00:48:39,155 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-17 00:48:39,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:39,340 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:39,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:39,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1621578921, now seen corresponding path program 1 times [2024-11-17 00:48:39,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:39,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895673546] [2024-11-17 00:48:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:39,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:40,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:40,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:48:40,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:40,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895673546] [2024-11-17 00:48:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895673546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:40,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487045957] [2024-11-17 00:48:40,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:40,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:40,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:40,711 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-17 00:48:40,712 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-17 00:48:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:40,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-17 00:48:40,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:40,920 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-17 00:48:40,925 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-17 00:48:41,215 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:48:41,215 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-17 00:48:41,220 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-17 00:48:41,294 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-17 00:48:41,300 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-17 00:48:41,393 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:41,394 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-17 00:48:41,398 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-17 00:48:41,706 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:41,707 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-17 00:48:41,710 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-17 00:48:41,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:41,820 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 37 treesize of output 17 [2024-11-17 00:48:41,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:41,827 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 27 treesize of output 11 [2024-11-17 00:48:41,913 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 25 treesize of output 13 [2024-11-17 00:48:41,916 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 7 treesize of output 3 [2024-11-17 00:48:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-17 00:48:41,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:42,211 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_1812 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1812 .cse1)) v_ArrVal_1812)) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1812) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1812 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1812 .cse1)) v_ArrVal_1812)) (forall ((v_ArrVal_1813 (Array Int Int))) (or (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1812) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1813) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_1813 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_1813 .cse1)))))))))) is different from false [2024-11-17 00:48:42,395 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1811 (Array Int Int)) (v_ArrVal_1810 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1810) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1811) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1810 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1810) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2024-11-17 00:48:42,414 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1811 (Array Int Int)) (v_ArrVal_1810 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1810) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1811) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1810 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1810) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)))) is different from false [2024-11-17 00:48:42,552 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|))) (and (forall ((v_ArrVal_1811 (Array Int Int)) (v_ArrVal_1810 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1810) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1811) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1810 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1810) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))))) is different from false [2024-11-17 00:48:42,659 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1810 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1810) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_1811 (Array Int Int)) (v_ArrVal_1810 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1810) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1811) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2024-11-17 00:48:42,674 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1811 (Array Int Int)) (v_ArrVal_1810 (Array Int Int)) (v_ArrVal_1809 (Array Int Int)) (v_ArrVal_1808 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1808))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1809) .cse0 v_ArrVal_1810) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1811) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1810 (Array Int Int)) (v_ArrVal_1809 (Array Int Int)) (v_ArrVal_1808 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1809) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1808) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1810) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2024-11-17 00:48:42,699 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1810 (Array Int Int)) (v_ArrVal_1809 (Array Int Int)) (v_ArrVal_1808 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1809) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1808) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1810) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1811 (Array Int Int)) (v_ArrVal_1810 (Array Int Int)) (v_ArrVal_1809 (Array Int Int)) (v_ArrVal_1808 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1808))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1809) .cse0 v_ArrVal_1810) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1811) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2024-11-17 00:48:42,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:42,708 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 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-17 00:48:42,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:42,715 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 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-17 00:48:42,719 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 54 treesize of output 46 [2024-11-17 00:48:42,723 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 146 treesize of output 134 [2024-11-17 00:48:42,729 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 32 treesize of output 28 [2024-11-17 00:48:42,732 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 56 treesize of output 52 [2024-11-17 00:48:42,735 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 26 treesize of output 24 [2024-11-17 00:48:42,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:42,754 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 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-17 00:48:42,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:42,760 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 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-17 00:48:42,763 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:42,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 74 treesize of output 50 [2024-11-17 00:48:42,767 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:42,768 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:48:42,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 12 [2024-11-17 00:48:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487045957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:43,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:43,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 46 [2024-11-17 00:48:43,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711135221] [2024-11-17 00:48:43,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:43,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-17 00:48:43,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:43,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-17 00:48:43,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2867, Unknown=55, NotChecked=798, Total=3906 [2024-11-17 00:48:43,009 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand has 47 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 41 states have internal predecessors, (101), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:48:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:43,947 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2024-11-17 00:48:43,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-17 00:48:43,948 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 41 states have internal predecessors, (101), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 57 [2024-11-17 00:48:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:43,948 INFO L225 Difference]: With dead ends: 118 [2024-11-17 00:48:43,948 INFO L226 Difference]: Without dead ends: 118 [2024-11-17 00:48:43,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=259, Invalid=3746, Unknown=55, NotChecked=910, Total=4970 [2024-11-17 00:48:43,950 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 48 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:43,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1820 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:48:43,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-17 00:48:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-17 00:48:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 113 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2024-11-17 00:48:43,958 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 57 [2024-11-17 00:48:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:43,958 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2024-11-17 00:48:43,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 41 states have internal predecessors, (101), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:48:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2024-11-17 00:48:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-17 00:48:43,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:43,959 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:43,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-17 00:48:44,160 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-17 00:48:44,160 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:44,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:44,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1612010570, now seen corresponding path program 2 times [2024-11-17 00:48:44,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:44,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725257586] [2024-11-17 00:48:44,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:44,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:44,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:48:44,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:44,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725257586] [2024-11-17 00:48:44,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725257586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:44,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:44,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:48:44,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028939476] [2024-11-17 00:48:44,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:44,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:48:44,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:44,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:48:44,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:48:44,292 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:44,367 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2024-11-17 00:48:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:44,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2024-11-17 00:48:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:44,368 INFO L225 Difference]: With dead ends: 101 [2024-11-17 00:48:44,368 INFO L226 Difference]: Without dead ends: 101 [2024-11-17 00:48:44,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:48:44,372 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 69 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:44,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 293 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:44,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-17 00:48:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-17 00:48:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.197674418604651) internal successors, (103), 97 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2024-11-17 00:48:44,377 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 61 [2024-11-17 00:48:44,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:44,377 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2024-11-17 00:48:44,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2024-11-17 00:48:44,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-17 00:48:44,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:44,378 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:44,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 00:48:44,379 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:44,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:44,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1829093920, now seen corresponding path program 1 times [2024-11-17 00:48:44,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:44,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889279910] [2024-11-17 00:48:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:44,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:46,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:46,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:48:46,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:46,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889279910] [2024-11-17 00:48:46,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889279910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:46,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308371862] [2024-11-17 00:48:46,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:46,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:46,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:46,767 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-17 00:48:46,768 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-17 00:48:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:46,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-17 00:48:46,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:46,991 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-17 00:48:47,202 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:48:47,202 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-17 00:48:47,290 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-17 00:48:47,403 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:47,403 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 25 treesize of output 26 [2024-11-17 00:48:47,783 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:47,783 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 66 treesize of output 59 [2024-11-17 00:48:47,787 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 25 treesize of output 17 [2024-11-17 00:48:47,789 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 34 treesize of output 21 [2024-11-17 00:48:47,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:47,943 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 45 treesize of output 25 [2024-11-17 00:48:47,950 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 26 treesize of output 21 [2024-11-17 00:48:47,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:47,955 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 37 treesize of output 21 [2024-11-17 00:48:48,111 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 33 treesize of output 21 [2024-11-17 00:48:48,115 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 13 [2024-11-17 00:48:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:48:48,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:48,493 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2037 (Array Int Int)) (v_ArrVal_2036 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_2038 .cse0)) v_ArrVal_2038)) (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2036) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2038) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2037) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1)) (not (= v_ArrVal_2037 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_2037 .cse0))))))) is different from false [2024-11-17 00:48:48,536 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_41| Int)) (or (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2036) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) 1)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_41| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-17 00:48:48,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:48,620 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 1 case distinctions, treesize of input 40 treesize of output 41 [2024-11-17 00:48:48,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:48,629 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 79 treesize of output 78 [2024-11-17 00:48:48,636 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 29 treesize of output 18 [2024-11-17 00:48:48,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:48,905 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 38 treesize of output 37 [2024-11-17 00:48:48,909 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 11 [2024-11-17 00:48:49,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2031) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-17 00:48:49,098 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2031) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-17 00:48:49,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:49,106 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 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-17 00:48:49,108 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 33 treesize of output 25 [2024-11-17 00:48:49,111 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 6 treesize of output 4 [2024-11-17 00:48:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-17 00:48:49,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308371862] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:48:49,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:48:49,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 29, 30] total 82 [2024-11-17 00:48:49,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662777548] [2024-11-17 00:48:49,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:49,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2024-11-17 00:48:49,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:49,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2024-11-17 00:48:49,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=5712, Unknown=19, NotChecked=620, Total=6642 [2024-11-17 00:48:49,452 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 82 states, 81 states have (on average 1.9506172839506173) internal successors, (158), 73 states have internal predecessors, (158), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:48:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:51,091 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-17 00:48:51,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-17 00:48:51,092 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 1.9506172839506173) internal successors, (158), 73 states have internal predecessors, (158), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 63 [2024-11-17 00:48:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:51,092 INFO L225 Difference]: With dead ends: 101 [2024-11-17 00:48:51,092 INFO L226 Difference]: Without dead ends: 101 [2024-11-17 00:48:51,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2697 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=465, Invalid=8088, Unknown=19, NotChecked=740, Total=9312 [2024-11-17 00:48:51,094 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 131 mSDsluCounter, 2451 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 380 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:51,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 2510 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1582 Invalid, 0 Unknown, 380 Unchecked, 0.9s Time] [2024-11-17 00:48:51,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-17 00:48:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-17 00:48:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.186046511627907) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2024-11-17 00:48:51,097 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 63 [2024-11-17 00:48:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:51,097 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2024-11-17 00:48:51,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 1.9506172839506173) internal successors, (158), 73 states have internal predecessors, (158), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:48:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2024-11-17 00:48:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-17 00:48:51,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:51,098 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:51,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-17 00:48:51,302 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,SelfDestructingSolverStorable22 [2024-11-17 00:48:51,303 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:51,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:51,303 INFO L85 PathProgramCache]: Analyzing trace with hash 724992069, now seen corresponding path program 1 times [2024-11-17 00:48:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:51,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000139818] [2024-11-17 00:48:51,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:51,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:48:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:52,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000139818] [2024-11-17 00:48:52,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000139818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:52,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947295843] [2024-11-17 00:48:52,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:52,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:52,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:52,169 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-17 00:48:52,175 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-17 00:48:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:52,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-17 00:48:52,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:52,516 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 17 treesize of output 13 [2024-11-17 00:48:52,718 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 30 treesize of output 12 [2024-11-17 00:48:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 00:48:52,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:52,919 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 38 treesize of output 32 [2024-11-17 00:48:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 00:48:52,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947295843] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:48:52,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:48:52,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 34 [2024-11-17 00:48:52,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182496749] [2024-11-17 00:48:52,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:52,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-17 00:48:52,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-17 00:48:52,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2024-11-17 00:48:52,969 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 32 states have internal predecessors, (131), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:53,634 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2024-11-17 00:48:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-17 00:48:53,634 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 32 states have internal predecessors, (131), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 71 [2024-11-17 00:48:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:53,635 INFO L225 Difference]: With dead ends: 108 [2024-11-17 00:48:53,635 INFO L226 Difference]: Without dead ends: 108 [2024-11-17 00:48:53,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=241, Invalid=1921, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 00:48:53,636 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 113 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:53,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1807 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:48:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-17 00:48:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-11-17 00:48:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.1777777777777778) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2024-11-17 00:48:53,639 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 71 [2024-11-17 00:48:53,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:53,639 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2024-11-17 00:48:53,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 32 states have internal predecessors, (131), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2024-11-17 00:48:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 00:48:53,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:53,640 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:53,655 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-17 00:48:53,840 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,SelfDestructingSolverStorable23 [2024-11-17 00:48:53,841 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:53,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:53,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1043294469, now seen corresponding path program 1 times [2024-11-17 00:48:53,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:53,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971228481] [2024-11-17 00:48:53,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:53,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:53,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:54,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-17 00:48:54,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:54,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971228481] [2024-11-17 00:48:54,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971228481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:54,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:54,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:48:54,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472962649] [2024-11-17 00:48:54,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:54,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:48:54,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:54,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:48:54,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:54,040 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:54,191 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2024-11-17 00:48:54,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:48:54,191 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2024-11-17 00:48:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:54,192 INFO L225 Difference]: With dead ends: 122 [2024-11-17 00:48:54,192 INFO L226 Difference]: Without dead ends: 122 [2024-11-17 00:48:54,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:54,193 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 24 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:54,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 386 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-17 00:48:54,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 109. [2024-11-17 00:48:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.1894736842105262) internal successors, (113), 105 states have internal predecessors, (113), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2024-11-17 00:48:54,195 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 73 [2024-11-17 00:48:54,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:54,196 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2024-11-17 00:48:54,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2024-11-17 00:48:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 00:48:54,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:54,197 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:54,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-17 00:48:54,197 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:54,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:54,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1043294470, now seen corresponding path program 1 times [2024-11-17 00:48:54,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:54,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193901785] [2024-11-17 00:48:54,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:54,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:54,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:54,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-17 00:48:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:54,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193901785] [2024-11-17 00:48:54,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193901785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:54,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:54,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:48:54,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840278151] [2024-11-17 00:48:54,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:54,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:48:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:54,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:48:54,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:54,495 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:54,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:54,650 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2024-11-17 00:48:54,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:48:54,651 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2024-11-17 00:48:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:54,652 INFO L225 Difference]: With dead ends: 107 [2024-11-17 00:48:54,652 INFO L226 Difference]: Without dead ends: 107 [2024-11-17 00:48:54,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:54,653 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:54,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 435 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-17 00:48:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-17 00:48:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.1578947368421053) internal successors, (110), 103 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2024-11-17 00:48:54,657 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 73 [2024-11-17 00:48:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:54,658 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2024-11-17 00:48:54,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2024-11-17 00:48:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-17 00:48:54,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:54,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:54,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 00:48:54,659 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:54,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:54,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1878610602, now seen corresponding path program 1 times [2024-11-17 00:48:54,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557681209] [2024-11-17 00:48:54,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:54,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:54,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-17 00:48:54,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:54,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557681209] [2024-11-17 00:48:54,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557681209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:48:54,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:48:54,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 00:48:54,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516851243] [2024-11-17 00:48:54,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:48:54,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:48:54,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:54,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:48:54,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:54,848 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:54,966 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2024-11-17 00:48:54,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:48:54,966 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-17 00:48:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:54,967 INFO L225 Difference]: With dead ends: 107 [2024-11-17 00:48:54,967 INFO L226 Difference]: Without dead ends: 107 [2024-11-17 00:48:54,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:54,968 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 24 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:54,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 475 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-17 00:48:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-17 00:48:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.1473684210526316) internal successors, (109), 103 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2024-11-17 00:48:54,974 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 75 [2024-11-17 00:48:54,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:54,975 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2024-11-17 00:48:54,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:48:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2024-11-17 00:48:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-17 00:48:54,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:54,977 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:54,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-17 00:48:54,977 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:54,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash -753589273, now seen corresponding path program 2 times [2024-11-17 00:48:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:54,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623998924] [2024-11-17 00:48:54,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:55,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:55,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-17 00:48:55,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:55,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623998924] [2024-11-17 00:48:55,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623998924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:55,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070676678] [2024-11-17 00:48:55,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:48:55,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:55,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:55,124 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-17 00:48:55,126 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-17 00:48:55,380 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:48:55,380 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:48:55,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:48:55,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-17 00:48:55,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-17 00:48:55,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070676678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:48:55,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:48:55,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-11-17 00:48:55,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476092062] [2024-11-17 00:48:55,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:55,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:48:55,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:55,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:48:55,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:48:55,523 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 9 states have internal predecessors, (91), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:55,598 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2024-11-17 00:48:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:48:55,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 9 states have internal predecessors, (91), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 75 [2024-11-17 00:48:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:55,600 INFO L225 Difference]: With dead ends: 95 [2024-11-17 00:48:55,600 INFO L226 Difference]: Without dead ends: 95 [2024-11-17 00:48:55,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:48:55,601 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 83 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:55,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 315 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:48:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-17 00:48:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-17 00:48:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 91 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2024-11-17 00:48:55,603 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 75 [2024-11-17 00:48:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:55,604 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2024-11-17 00:48:55,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 9 states have internal predecessors, (91), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:55,604 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2024-11-17 00:48:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 00:48:55,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:55,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:55,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-17 00:48:55,805 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,SelfDestructingSolverStorable27 [2024-11-17 00:48:55,806 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:55,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:55,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1453043679, now seen corresponding path program 1 times [2024-11-17 00:48:55,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:55,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150615761] [2024-11-17 00:48:55,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:55,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:56,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:56,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-17 00:48:56,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:56,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150615761] [2024-11-17 00:48:56,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150615761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:56,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486191556] [2024-11-17 00:48:56,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:56,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:56,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:56,052 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-17 00:48:56,054 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-17 00:48:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:56,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-17 00:48:56,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:56,310 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-17 00:48:56,448 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:48:56,449 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-17 00:48:56,491 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-17 00:48:56,555 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:56,556 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-17 00:48:56,757 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:48:56,757 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-17 00:48:56,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:48:56,845 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 37 treesize of output 17 [2024-11-17 00:48:57,016 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 25 treesize of output 13 [2024-11-17 00:48:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:48:57,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:48:57,520 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-17 00:48:57,520 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 29 treesize of output 28 [2024-11-17 00:48:57,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:48:57,601 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 1 case distinctions, treesize of input 36 treesize of output 29 [2024-11-17 00:48:57,604 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 136 treesize of output 112 [2024-11-17 00:48:57,614 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 52 treesize of output 48 [2024-11-17 00:48:57,618 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 26 treesize of output 20 [2024-11-17 00:48:57,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486191556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:57,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:48:57,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22] total 28 [2024-11-17 00:48:57,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710906811] [2024-11-17 00:48:57,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:48:57,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-17 00:48:57,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:48:57,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-17 00:48:57,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1673, Unknown=9, NotChecked=0, Total=1806 [2024-11-17 00:48:57,761 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 29 states, 28 states have (on average 3.857142857142857) internal successors, (108), 25 states have internal predecessors, (108), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:48:58,237 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2024-11-17 00:48:58,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 00:48:58,238 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.857142857142857) internal successors, (108), 25 states have internal predecessors, (108), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 77 [2024-11-17 00:48:58,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:48:58,238 INFO L225 Difference]: With dead ends: 103 [2024-11-17 00:48:58,238 INFO L226 Difference]: Without dead ends: 103 [2024-11-17 00:48:58,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=165, Invalid=2276, Unknown=9, NotChecked=0, Total=2450 [2024-11-17 00:48:58,240 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:48:58,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 827 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:48:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-17 00:48:58,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2024-11-17 00:48:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 91 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:48:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2024-11-17 00:48:58,245 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 77 [2024-11-17 00:48:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:48:58,246 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2024-11-17 00:48:58,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.857142857142857) internal successors, (108), 25 states have internal predecessors, (108), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:48:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2024-11-17 00:48:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 00:48:58,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:48:58,247 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:48:58,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-17 00:48:58,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:58,447 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:48:58,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:48:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1453043680, now seen corresponding path program 1 times [2024-11-17 00:48:58,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:48:58,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831575063] [2024-11-17 00:48:58,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:58,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:48:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:59,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:48:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:59,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:48:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:48:59,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:48:59,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831575063] [2024-11-17 00:48:59,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831575063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:48:59,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447969126] [2024-11-17 00:48:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:48:59,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:48:59,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:48:59,686 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-17 00:48:59,693 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-17 00:48:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:48:59,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-17 00:48:59,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:48:59,953 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-17 00:49:00,095 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:49:00,095 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-17 00:49:00,164 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-17 00:49:00,168 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-17 00:49:00,299 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-17 00:49:00,300 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 35 [2024-11-17 00:49:00,304 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-17 00:49:00,708 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-17 00:49:00,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 50 [2024-11-17 00:49:00,716 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-17 00:49:00,721 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 5 treesize of output 3 [2024-11-17 00:49:00,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:49:00,895 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 27 treesize of output 11 [2024-11-17 00:49:00,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:49:00,901 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 37 treesize of output 17 [2024-11-17 00:49:01,086 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 25 treesize of output 13 [2024-11-17 00:49:01,090 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 7 treesize of output 3 [2024-11-17 00:49:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-17 00:49:01,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:02,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:02,061 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 90 treesize of output 94 [2024-11-17 00:49:02,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:02,299 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 1 case distinctions, treesize of input 51 treesize of output 52 [2024-11-17 00:49:02,304 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 71 treesize of output 63 [2024-11-17 00:49:02,307 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 71 treesize of output 65 [2024-11-17 00:49:02,310 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 54 treesize of output 52 [2024-11-17 00:49:02,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:02,342 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 1 case distinctions, treesize of input 49 treesize of output 50 [2024-11-17 00:49:02,346 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:02,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:02,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:02,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2024-11-17 00:49:02,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:02,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:02,362 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 34 treesize of output 27 [2024-11-17 00:49:02,364 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:02,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2024-11-17 00:49:02,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447969126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:02,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:49:02,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23] total 46 [2024-11-17 00:49:02,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203262661] [2024-11-17 00:49:02,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:02,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-17 00:49:02,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:02,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-17 00:49:02,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3693, Unknown=12, NotChecked=0, Total=3906 [2024-11-17 00:49:02,636 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 47 states, 46 states have (on average 2.630434782608696) internal successors, (121), 42 states have internal predecessors, (121), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:49:03,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:03,688 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2024-11-17 00:49:03,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-17 00:49:03,689 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.630434782608696) internal successors, (121), 42 states have internal predecessors, (121), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 77 [2024-11-17 00:49:03,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:03,689 INFO L225 Difference]: With dead ends: 97 [2024-11-17 00:49:03,689 INFO L226 Difference]: Without dead ends: 97 [2024-11-17 00:49:03,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=375, Invalid=6255, Unknown=12, NotChecked=0, Total=6642 [2024-11-17 00:49:03,691 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 71 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:03,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1242 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:49:03,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-17 00:49:03,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-17 00:49:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 87 states have (on average 1.1264367816091954) internal successors, (98), 93 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:49:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-11-17 00:49:03,694 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 77 [2024-11-17 00:49:03,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:03,694 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-11-17 00:49:03,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.630434782608696) internal successors, (121), 42 states have internal predecessors, (121), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:49:03,694 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-11-17 00:49:03,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 00:49:03,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:03,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:03,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-17 00:49:03,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:03,896 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:49:03,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2094679804, now seen corresponding path program 1 times [2024-11-17 00:49:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:03,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961325913] [2024-11-17 00:49:03,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:04,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:49:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:04,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:49:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-17 00:49:04,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:04,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961325913] [2024-11-17 00:49:04,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961325913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:04,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:04,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 00:49:04,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698933972] [2024-11-17 00:49:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:04,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:49:04,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:04,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:49:04,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:49:04,111 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:49:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:04,258 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2024-11-17 00:49:04,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:49:04,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-17 00:49:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:04,259 INFO L225 Difference]: With dead ends: 96 [2024-11-17 00:49:04,260 INFO L226 Difference]: Without dead ends: 96 [2024-11-17 00:49:04,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:49:04,260 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 13 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:04,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 390 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:04,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-17 00:49:04,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-17 00:49:04,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 87 states have (on average 1.103448275862069) internal successors, (96), 92 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:49:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2024-11-17 00:49:04,264 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 78 [2024-11-17 00:49:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:04,265 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2024-11-17 00:49:04,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:49:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2024-11-17 00:49:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-17 00:49:04,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:04,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:04,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-17 00:49:04,266 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:49:04,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:04,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1351138340, now seen corresponding path program 1 times [2024-11-17 00:49:04,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:04,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662162939] [2024-11-17 00:49:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:04,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:49:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:05,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:49:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-17 00:49:05,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:05,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662162939] [2024-11-17 00:49:05,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662162939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:05,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75539151] [2024-11-17 00:49:05,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:05,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:05,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:05,226 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:49:05,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-17 00:49:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:05,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-17 00:49:05,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:05,488 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-17 00:49:05,524 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 5 treesize of output 3 [2024-11-17 00:49:05,611 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:49:05,612 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-17 00:49:05,683 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-17 00:49:05,767 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:49:05,767 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-17 00:49:06,012 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:49:06,013 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-17 00:49:06,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:49:06,089 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 37 treesize of output 17 [2024-11-17 00:49:06,225 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 25 treesize of output 13 [2024-11-17 00:49:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-17 00:49:06,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:06,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:06,973 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 1 case distinctions, treesize of input 36 treesize of output 29 [2024-11-17 00:49:06,979 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 136 treesize of output 112 [2024-11-17 00:49:06,983 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 60 treesize of output 56 [2024-11-17 00:49:06,987 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 30 treesize of output 24 [2024-11-17 00:49:07,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75539151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:07,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:49:07,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 41 [2024-11-17 00:49:07,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152513361] [2024-11-17 00:49:07,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:07,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-17 00:49:07,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:07,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-17 00:49:07,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2989, Unknown=4, NotChecked=0, Total=3192 [2024-11-17 00:49:07,152 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 42 states, 41 states have (on average 2.8536585365853657) internal successors, (117), 37 states have internal predecessors, (117), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:49:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:07,850 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2024-11-17 00:49:07,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 00:49:07,850 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.8536585365853657) internal successors, (117), 37 states have internal predecessors, (117), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 80 [2024-11-17 00:49:07,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:07,851 INFO L225 Difference]: With dead ends: 97 [2024-11-17 00:49:07,851 INFO L226 Difference]: Without dead ends: 97 [2024-11-17 00:49:07,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=277, Invalid=4009, Unknown=4, NotChecked=0, Total=4290 [2024-11-17 00:49:07,852 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 71 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:07,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 971 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:49:07,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-17 00:49:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-17 00:49:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 93 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:49:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2024-11-17 00:49:07,855 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 80 [2024-11-17 00:49:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:07,856 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2024-11-17 00:49:07,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.8536585365853657) internal successors, (117), 37 states have internal predecessors, (117), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:49:07,856 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2024-11-17 00:49:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-17 00:49:07,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:07,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:07,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-17 00:49:08,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:08,058 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:49:08,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:08,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1682096847, now seen corresponding path program 1 times [2024-11-17 00:49:08,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:08,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114348240] [2024-11-17 00:49:08,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:08,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:49:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:08,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:49:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-17 00:49:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:08,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114348240] [2024-11-17 00:49:08,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114348240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:08,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108489538] [2024-11-17 00:49:08,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:08,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:08,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:08,822 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:49:08,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-17 00:49:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:09,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-17 00:49:09,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:09,088 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-17 00:49:09,174 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:49:09,175 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-17 00:49:09,227 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-17 00:49:09,289 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:49:09,289 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 25 treesize of output 26 [2024-11-17 00:49:09,401 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:49:09,401 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 25 treesize of output 26 [2024-11-17 00:49:09,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:49:09,444 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 28 treesize of output 12 [2024-11-17 00:49:09,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:09,515 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 16 treesize of output 16 [2024-11-17 00:49:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-17 00:49:09,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:09,723 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3180 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3180) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= v_ArrVal_3180 (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_3180 .cse0))))))) is different from false [2024-11-17 00:49:09,874 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (v_ArrVal_3179 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3179) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| 4) v_DerPreprocessor_14) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-17 00:49:09,958 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (v_ArrVal_3179 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| 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|) v_ArrVal_3179) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| 4) v_DerPreprocessor_14) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-17 00:49:09,971 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (v_ArrVal_3179 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3179) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| 4) v_DerPreprocessor_14) 0))))) is different from false [2024-11-17 00:49:10,047 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (v_ArrVal_3178 (Array Int Int)) (v_ArrVal_3179 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3178))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3179)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| 4) v_DerPreprocessor_14) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) is different from false [2024-11-17 00:49:10,067 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (v_ArrVal_3178 (Array Int Int)) (v_ArrVal_3179 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| Int)) (or (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3178))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3179)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| 4) v_DerPreprocessor_14) 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2024-11-17 00:49:10,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:10,078 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 1 case distinctions, treesize of input 42 treesize of output 35 [2024-11-17 00:49:10,082 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 285 treesize of output 267 [2024-11-17 00:49:10,086 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:10,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:10,095 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 174 treesize of output 171 [2024-11-17 00:49:10,100 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:10,102 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 147 treesize of output 141 [2024-11-17 00:49:10,106 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:10,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:10,114 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 143 treesize of output 139 [2024-11-17 00:49:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 11 not checked. [2024-11-17 00:49:10,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108489538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:49:10,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:49:10,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 26] total 60 [2024-11-17 00:49:10,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036994380] [2024-11-17 00:49:10,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:10,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-17 00:49:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:10,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-17 00:49:10,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2649, Unknown=49, NotChecked=654, Total=3540 [2024-11-17 00:49:10,676 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 60 states, 60 states have (on average 2.6333333333333333) internal successors, (158), 52 states have internal predecessors, (158), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-17 00:49:11,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:11,511 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2024-11-17 00:49:11,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 00:49:11,512 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.6333333333333333) internal successors, (158), 52 states have internal predecessors, (158), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 83 [2024-11-17 00:49:11,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:11,513 INFO L225 Difference]: With dead ends: 96 [2024-11-17 00:49:11,513 INFO L226 Difference]: Without dead ends: 96 [2024-11-17 00:49:11,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 133 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=234, Invalid=3400, Unknown=50, NotChecked=738, Total=4422 [2024-11-17 00:49:11,514 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 97 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 439 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:11,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1180 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1196 Invalid, 0 Unknown, 439 Unchecked, 0.6s Time] [2024-11-17 00:49:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-17 00:49:11,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2024-11-17 00:49:11,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 90 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:49:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2024-11-17 00:49:11,516 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 83 [2024-11-17 00:49:11,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:11,517 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2024-11-17 00:49:11,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.6333333333333333) internal successors, (158), 52 states have internal predecessors, (158), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-17 00:49:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2024-11-17 00:49:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-17 00:49:11,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:11,518 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:11,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-17 00:49:11,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:11,719 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2024-11-17 00:49:11,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:11,720 INFO L85 PathProgramCache]: Analyzing trace with hash 780235236, now seen corresponding path program 1 times [2024-11-17 00:49:11,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:11,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436311873] [2024-11-17 00:49:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:11,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:13,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:49:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:13,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 00:49:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-17 00:49:13,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:13,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436311873] [2024-11-17 00:49:13,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436311873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:13,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311125615] [2024-11-17 00:49:13,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:13,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:13,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:13,343 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:49:13,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-17 00:49:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:13,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-17 00:49:13,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:13,613 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-17 00:49:13,736 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:49:13,736 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-17 00:49:13,808 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 15 treesize of output 1 [2024-11-17 00:49:13,813 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-17 00:49:13,914 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-17 00:49:13,914 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 47 treesize of output 33 [2024-11-17 00:49:13,917 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 27 treesize of output 22 [2024-11-17 00:49:14,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:49:14,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:49:14,269 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:49:14,270 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 66 [2024-11-17 00:49:14,280 INFO L349 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2024-11-17 00:49:14,280 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 1 case distinctions, treesize of input 57 treesize of output 28 [2024-11-17 00:49:14,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:49:14,404 INFO L349 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2024-11-17 00:49:14,404 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 2 case distinctions, treesize of input 50 treesize of output 32 [2024-11-17 00:49:14,409 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 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-17 00:49:14,411 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 5 treesize of output 3 [2024-11-17 00:49:14,801 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-17 00:49:14,801 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 36 [2024-11-17 00:49:14,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:14,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-17 00:49:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-17 00:49:14,989 INFO L311 TraceCheckSpWp]: Computing backward predicates...