./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/dll2c_remove_all.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 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:01:55,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:01:55,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:01:55,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:01:55,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:01:55,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:01:55,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:01:55,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:01:55,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:01:55,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:01:55,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:01:55,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:01:55,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:01:55,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:01:55,738 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:01:55,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:01:55,738 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:01:55,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:01:55,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:01:55,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:01:55,742 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:01:55,742 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:01:55,742 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:01:55,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:01:55,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:01:55,743 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:01:55,743 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:01:55,743 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:01:55,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:01:55,744 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:01:55,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:01:55,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:01:55,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:01:55,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:01:55,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:01:55,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:01:55,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:01:55,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:01:55,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:01:55,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:01:55,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:01:55,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:01:55,748 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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2024-11-09 08:01:55,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:01:56,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:01:56,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:01:56,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:01:56,022 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:01:56,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_remove_all.i [2024-11-09 08:01:57,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:01:57,839 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:01:57,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2024-11-09 08:01:57,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4626d9b50/691f80d0ae024940893e1afdaed39278/FLAGe3f378104 [2024-11-09 08:01:58,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4626d9b50/691f80d0ae024940893e1afdaed39278 [2024-11-09 08:01:58,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:01:58,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:01:58,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:01:58,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:01:58,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:01:58,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@588f5c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58, skipping insertion in model container [2024-11-09 08:01:58,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:01:58,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:01:58,583 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:01:58,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:01:58,743 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:01:58,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58 WrapperNode [2024-11-09 08:01:58,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:01:58,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:01:58,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:01:58,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:01:58,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,799 INFO L138 Inliner]: procedures = 126, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2024-11-09 08:01:58,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:01:58,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:01:58,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:01:58,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:01:58,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,851 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 11, 9]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 11 writes are split as follows [0, 9, 2]. [2024-11-09 08:01:58,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:01:58,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:01:58,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:01:58,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:01:58,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58" (1/1) ... [2024-11-09 08:01:58,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:01:58,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:01:58,918 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-09 08:01:58,929 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-09 08:01:58,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 08:01:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 08:01:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 08:01:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 08:01:58,975 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 08:01:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:01:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:01:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 08:01:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:01:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 08:01:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 08:01:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:01:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:01:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 08:01:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:01:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 08:01:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 08:01:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 08:01:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:01:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 08:01:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 08:01:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:01:58,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:01:59,145 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:01:59,148 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:01:59,468 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-09 08:01:59,468 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:01:59,484 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:01:59,484 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 08:01:59,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:01:59 BoogieIcfgContainer [2024-11-09 08:01:59,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:01:59,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:01:59,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:01:59,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:01:59,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:01:58" (1/3) ... [2024-11-09 08:01:59,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a643e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:01:59, skipping insertion in model container [2024-11-09 08:01:59,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:01:58" (2/3) ... [2024-11-09 08:01:59,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a643e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:01:59, skipping insertion in model container [2024-11-09 08:01:59,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:01:59" (3/3) ... [2024-11-09 08:01:59,493 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2024-11-09 08:01:59,512 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:01:59,513 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-09 08:01:59,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:01:59,569 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;@5036bb46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:01:59,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-09 08:01:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 98 states have internal predecessors, (107), 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-09 08:01:59,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:01:59,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:01:59,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:01:59,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:01:59,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:01:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash 893979442, now seen corresponding path program 1 times [2024-11-09 08:01:59,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:01:59,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866407015] [2024-11-09 08:01:59,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:01:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:01:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:01:59,836 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-09 08:01:59,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:01:59,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866407015] [2024-11-09 08:01:59,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866407015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:01:59,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:01:59,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:01:59,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904020729] [2024-11-09 08:01:59,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:01:59,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:01:59,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:01:59,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:01:59,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:01:59,879 INFO L87 Difference]: Start difference. First operand has 102 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 98 states have internal predecessors, (107), 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-09 08:02:00,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:00,032 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2024-11-09 08:02:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:02:00,035 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-09 08:02:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:00,042 INFO L225 Difference]: With dead ends: 98 [2024-11-09 08:02:00,043 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 08:02:00,045 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-09 08:02:00,049 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:00,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 146 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 08:02:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 08:02:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 91 states have internal predecessors, (95), 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-09 08:02:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-09 08:02:00,096 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 6 [2024-11-09 08:02:00,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:00,097 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-09 08:02:00,097 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-09 08:02:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-09 08:02:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 08:02:00,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:00,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 08:02:00,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:02:00,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:00,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:00,101 INFO L85 PathProgramCache]: Analyzing trace with hash 893979443, now seen corresponding path program 1 times [2024-11-09 08:02:00,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:00,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025086191] [2024-11-09 08:02:00,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:00,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,286 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-09 08:02:00,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:00,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025086191] [2024-11-09 08:02:00,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025086191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:00,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:00,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:02:00,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861810315] [2024-11-09 08:02:00,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:00,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:02:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:00,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:02:00,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:02:00,291 INFO L87 Difference]: Start difference. First operand 95 states and 99 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-09 08:02:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:00,365 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-09 08:02:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:02:00,365 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-09 08:02:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:00,367 INFO L225 Difference]: With dead ends: 92 [2024-11-09 08:02:00,367 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 08:02:00,367 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-09 08:02:00,368 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:00,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 08:02:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 08:02:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 88 states have internal predecessors, (92), 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-09 08:02:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-09 08:02:00,377 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 6 [2024-11-09 08:02:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:00,378 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-09 08:02:00,378 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-09 08:02:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-09 08:02:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 08:02:00,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:00,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:00,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:02:00,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:00,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:00,382 INFO L85 PathProgramCache]: Analyzing trace with hash -931409769, now seen corresponding path program 1 times [2024-11-09 08:02:00,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:00,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566990157] [2024-11-09 08:02:00,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:00,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,549 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-09 08:02:00,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:00,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566990157] [2024-11-09 08:02:00,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566990157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:00,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:00,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 08:02:00,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693956114] [2024-11-09 08:02:00,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:00,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:00,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:00,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:00,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 08:02:00,553 INFO L87 Difference]: Start difference. First operand 92 states and 96 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-09 08:02:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:00,675 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2024-11-09 08:02:00,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:00,676 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-09 08:02:00,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:00,677 INFO L225 Difference]: With dead ends: 103 [2024-11-09 08:02:00,680 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 08:02:00,681 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-09 08:02:00,682 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:00,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 213 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 08:02:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2024-11-09 08:02:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 50 states have (on average 1.86) internal successors, (93), 89 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-09 08:02:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-09 08:02:00,694 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 14 [2024-11-09 08:02:00,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:00,695 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-09 08:02:00,695 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-09 08:02:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-09 08:02:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:02:00,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:00,696 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:00,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:02:00,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:00,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:00,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1115366016, now seen corresponding path program 1 times [2024-11-09 08:02:00,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:00,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807178586] [2024-11-09 08:02:00,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:00,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 08:02:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:00,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807178586] [2024-11-09 08:02:00,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807178586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:00,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:00,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:02:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382010638] [2024-11-09 08:02:00,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:00,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:02:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:00,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:02:00,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:00,944 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-09 08:02:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:01,178 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-09 08:02:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:02:01,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2024-11-09 08:02:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:01,179 INFO L225 Difference]: With dead ends: 92 [2024-11-09 08:02:01,179 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 08:02:01,180 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-09 08:02:01,181 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:01,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 285 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:01,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 08:02:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 08:02:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 1.84) internal successors, (92), 88 states have internal predecessors, (92), 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-09 08:02:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-09 08:02:01,191 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 24 [2024-11-09 08:02:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:01,191 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-09 08:02:01,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-09 08:02:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-09 08:02:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 08:02:01,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:01,193 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:01,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:02:01,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:01,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:01,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1115366017, now seen corresponding path program 1 times [2024-11-09 08:02:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:01,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878582001] [2024-11-09 08:02:01,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:01,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:01,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:01,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:01,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:01,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878582001] [2024-11-09 08:02:01,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878582001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:01,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:01,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:02:01,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844131989] [2024-11-09 08:02:01,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:01,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:02:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:01,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:02:01,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:01,550 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-09 08:02:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:01,772 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-09 08:02:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:02:01,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2024-11-09 08:02:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:01,774 INFO L225 Difference]: With dead ends: 91 [2024-11-09 08:02:01,775 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 08:02:01,775 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-09 08:02:01,776 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 6 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:01,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 309 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 08:02:01,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 08:02:01,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.82) internal successors, (91), 87 states have internal predecessors, (91), 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-09 08:02:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-11-09 08:02:01,783 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 24 [2024-11-09 08:02:01,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:01,784 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-11-09 08:02:01,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-09 08:02:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-11-09 08:02:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:02:01,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:01,785 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:01,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:02:01,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:01,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:01,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1875082911, now seen corresponding path program 1 times [2024-11-09 08:02:01,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:01,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559363335] [2024-11-09 08:02:01,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:01,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:01,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:02,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:02,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:02,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559363335] [2024-11-09 08:02:02,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559363335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:02,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874315536] [2024-11-09 08:02:02,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:02,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:02,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:02,171 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-09 08:02:02,172 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-09 08:02:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:02,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 08:02:02,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:02,371 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-09 08:02:02,432 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-09 08:02:02,522 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 08:02:02,522 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-09 08:02:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 08:02:02,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:02,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874315536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:02,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:02,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-11-09 08:02:02,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147625608] [2024-11-09 08:02:02,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:02,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:02:02,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:02,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:02:02,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-09 08:02:02,604 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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-09 08:02:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:02,925 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2024-11-09 08:02:02,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:02:02,926 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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 26 [2024-11-09 08:02:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:02,928 INFO L225 Difference]: With dead ends: 96 [2024-11-09 08:02:02,930 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 08:02:02,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 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-09 08:02:02,931 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:02,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2024-11-09 08:02:02,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 08:02:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 08:02:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 91 states have internal predecessors, (97), 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-09 08:02:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2024-11-09 08:02:02,946 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2024-11-09 08:02:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:02,946 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2024-11-09 08:02:02,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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-09 08:02:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-11-09 08:02:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 08:02:02,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:02,951 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:02,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 08:02:03,152 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-09 08:02:03,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:03,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:03,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1875082910, now seen corresponding path program 1 times [2024-11-09 08:02:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:03,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523164732] [2024-11-09 08:02:03,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:03,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:03,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:03,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:03,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523164732] [2024-11-09 08:02:03,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523164732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132395034] [2024-11-09 08:02:03,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:03,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:03,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:03,604 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-09 08:02:03,605 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-09 08:02:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:03,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 08:02:03,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:03,744 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-09 08:02:03,752 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-09 08:02:04,001 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:02:04,001 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-09 08:02:04,023 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:04,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 08:02:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:04,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:04,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132395034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:04,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:04,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-09 08:02:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642260198] [2024-11-09 08:02:04,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:04,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 08:02:04,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:04,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 08:02:04,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-11-09 08:02:04,282 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 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-09 08:02:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:04,842 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2024-11-09 08:02:04,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 08:02:04,843 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 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 26 [2024-11-09 08:02:04,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:04,844 INFO L225 Difference]: With dead ends: 96 [2024-11-09 08:02:04,844 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 08:02:04,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2024-11-09 08:02:04,845 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:04,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 535 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 08:02:04,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 08:02:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 08:02:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 91 states have internal predecessors, (96), 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-09 08:02:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-09 08:02:04,851 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 26 [2024-11-09 08:02:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:04,851 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-09 08:02:04,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 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-09 08:02:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-09 08:02:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 08:02:04,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:04,852 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] [2024-11-09 08:02:04,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 08:02:05,056 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-09 08:02:05,057 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:05,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1931740983, now seen corresponding path program 1 times [2024-11-09 08:02:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:05,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626618246] [2024-11-09 08:02:05,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:05,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:05,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:05,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:05,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:05,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626618246] [2024-11-09 08:02:05,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626618246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:05,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072437262] [2024-11-09 08:02:05,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:05,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:05,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:05,228 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-09 08:02:05,230 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-09 08:02:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:05,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 08:02:05,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:05,363 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-09 08:02:05,429 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-09 08:02:05,453 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:02:05,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 08:02:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-09 08:02:05,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:05,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072437262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:05,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:05,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2024-11-09 08:02:05,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901562049] [2024-11-09 08:02:05,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:05,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 08:02:05,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:05,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 08:02:05,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=131, Unknown=1, NotChecked=22, Total=182 [2024-11-09 08:02:05,667 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 08:02:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:05,963 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2024-11-09 08:02:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:05,965 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-11-09 08:02:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:05,966 INFO L225 Difference]: With dead ends: 95 [2024-11-09 08:02:05,966 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 08:02:05,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2024-11-09 08:02:05,967 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 10 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:05,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 619 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 361 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2024-11-09 08:02:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 08:02:05,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 08:02:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 90 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-09 08:02:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2024-11-09 08:02:05,974 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 28 [2024-11-09 08:02:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:05,974 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2024-11-09 08:02:05,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 08:02:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2024-11-09 08:02:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 08:02:05,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:05,975 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] [2024-11-09 08:02:05,990 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-09 08:02:06,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:06,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:06,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash -250352333, now seen corresponding path program 1 times [2024-11-09 08:02:06,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:06,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116412543] [2024-11-09 08:02:06,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:06,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,413 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-09 08:02:06,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:06,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116412543] [2024-11-09 08:02:06,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116412543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:06,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018052997] [2024-11-09 08:02:06,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:06,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:06,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:06,417 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-09 08:02:06,418 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-09 08:02:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:06,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 08:02:06,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:06,564 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-09 08:02:06,569 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-09 08:02:06,734 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-09 08:02:06,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:06,778 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-09 08:02:06,793 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:06,793 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-09 08:02:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 08:02:06,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:06,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018052997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:06,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:06,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-09 08:02:06,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103917971] [2024-11-09 08:02:06,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:06,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 08:02:06,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:06,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 08:02:06,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-11-09 08:02:06,999 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 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-09 08:02:07,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:07,425 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-11-09 08:02:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 08:02:07,426 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 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 29 [2024-11-09 08:02:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:07,428 INFO L225 Difference]: With dead ends: 112 [2024-11-09 08:02:07,428 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 08:02:07,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-11-09 08:02:07,430 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:07,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 632 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 476 Invalid, 0 Unknown, 115 Unchecked, 0.3s Time] [2024-11-09 08:02:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 08:02:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2024-11-09 08:02:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 99 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2024-11-09 08:02:07,442 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 29 [2024-11-09 08:02:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:07,442 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2024-11-09 08:02:07,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 12 states have internal predecessors, (48), 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-09 08:02:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2024-11-09 08:02:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:02:07,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:07,447 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] [2024-11-09 08:02:07,466 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-09 08:02:07,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:07,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:07,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash 829012243, now seen corresponding path program 1 times [2024-11-09 08:02:07,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:07,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195576541] [2024-11-09 08:02:07,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:07,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:07,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:07,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:07,806 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-09 08:02:07,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:07,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195576541] [2024-11-09 08:02:07,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195576541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:07,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:07,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 08:02:07,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785078153] [2024-11-09 08:02:07,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:07,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:02:07,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:07,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:02:07,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:07,808 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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-09 08:02:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:08,014 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2024-11-09 08:02:08,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:08,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 30 [2024-11-09 08:02:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:08,015 INFO L225 Difference]: With dead ends: 104 [2024-11-09 08:02:08,015 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 08:02:08,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:08,016 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 7 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:08,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 314 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 08:02:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 08:02:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 98 states have internal predecessors, (107), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2024-11-09 08:02:08,020 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 30 [2024-11-09 08:02:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:08,020 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2024-11-09 08:02:08,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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-09 08:02:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2024-11-09 08:02:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 08:02:08,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:08,021 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] [2024-11-09 08:02:08,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 08:02:08,022 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:08,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:08,022 INFO L85 PathProgramCache]: Analyzing trace with hash 829012244, now seen corresponding path program 1 times [2024-11-09 08:02:08,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:08,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34472635] [2024-11-09 08:02:08,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:08,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:08,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:08,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:08,289 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-09 08:02:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:08,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34472635] [2024-11-09 08:02:08,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34472635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:08,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:08,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 08:02:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262132082] [2024-11-09 08:02:08,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:08,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:02:08,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:02:08,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:08,292 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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-09 08:02:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:08,492 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2024-11-09 08:02:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:08,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 30 [2024-11-09 08:02:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:08,493 INFO L225 Difference]: With dead ends: 103 [2024-11-09 08:02:08,493 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 08:02:08,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:08,494 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 6 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:08,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 339 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 08:02:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-09 08:02:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 97 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2024-11-09 08:02:08,498 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 30 [2024-11-09 08:02:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:08,498 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2024-11-09 08:02:08,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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-09 08:02:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2024-11-09 08:02:08,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 08:02:08,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:08,500 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-09 08:02:08,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 08:02:08,500 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:08,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:08,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2064334218, now seen corresponding path program 1 times [2024-11-09 08:02:08,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:08,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472423668] [2024-11-09 08:02:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:08,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:08,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:08,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:08,769 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-09 08:02:08,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:08,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472423668] [2024-11-09 08:02:08,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472423668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:08,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:08,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 08:02:08,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144065666] [2024-11-09 08:02:08,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:08,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:02:08,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:08,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:02:08,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:08,772 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-09 08:02:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:08,951 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2024-11-09 08:02:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:08,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-09 08:02:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:08,953 INFO L225 Difference]: With dead ends: 138 [2024-11-09 08:02:08,953 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 08:02:08,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:02:08,954 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 108 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:08,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 124 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 08:02:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 102. [2024-11-09 08:02:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 96 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2024-11-09 08:02:08,957 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 34 [2024-11-09 08:02:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:08,957 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2024-11-09 08:02:08,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-09 08:02:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2024-11-09 08:02:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 08:02:08,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:08,958 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-09 08:02:08,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 08:02:08,959 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:08,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2064334217, now seen corresponding path program 1 times [2024-11-09 08:02:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770182487] [2024-11-09 08:02:08,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:08,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 08:02:09,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:09,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770182487] [2024-11-09 08:02:09,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770182487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:09,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082192814] [2024-11-09 08:02:09,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:09,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:09,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:09,372 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-09 08:02:09,373 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-09 08:02:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:09,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 08:02:09,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:09,569 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-09 08:02:09,580 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-09 08:02:09,597 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-09 08:02:09,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:09,645 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-09 08:02:09,673 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-09 08:02:09,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:09,727 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-09 08:02:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 08:02:09,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:09,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082192814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:09,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:09,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2024-11-09 08:02:09,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51142835] [2024-11-09 08:02:09,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:09,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:02:09,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:09,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:02:09,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=120, Unknown=1, NotChecked=22, Total=182 [2024-11-09 08:02:09,910 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:10,098 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2024-11-09 08:02:10,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 08:02:10,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-09 08:02:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:10,099 INFO L225 Difference]: With dead ends: 94 [2024-11-09 08:02:10,100 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 08:02:10,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=138, Unknown=1, NotChecked=24, Total=210 [2024-11-09 08:02:10,100 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 135 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:10,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 119 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 171 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2024-11-09 08:02:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 08:02:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-09 08:02:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 88 states have internal predecessors, (98), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2024-11-09 08:02:10,104 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 34 [2024-11-09 08:02:10,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:10,105 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2024-11-09 08:02:10,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2024-11-09 08:02:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 08:02:10,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:10,106 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, 1] [2024-11-09 08:02:10,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 08:02:10,307 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-09 08:02:10,308 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:10,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:10,309 INFO L85 PathProgramCache]: Analyzing trace with hash 430148705, now seen corresponding path program 1 times [2024-11-09 08:02:10,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:10,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748970320] [2024-11-09 08:02:10,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:10,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:10,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:10,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:10,546 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-09 08:02:10,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748970320] [2024-11-09 08:02:10,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748970320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:10,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:10,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 08:02:10,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992776149] [2024-11-09 08:02:10,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:10,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 08:02:10,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:10,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 08:02:10,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:02:10,548 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 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-09 08:02:10,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:10,914 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2024-11-09 08:02:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 08:02:10,914 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 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 35 [2024-11-09 08:02:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:10,915 INFO L225 Difference]: With dead ends: 124 [2024-11-09 08:02:10,915 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 08:02:10,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 08:02:10,916 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 68 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:10,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 359 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:02:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 08:02:10,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2024-11-09 08:02:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.492537313432836) internal successors, (100), 89 states have internal predecessors, (100), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-11-09 08:02:10,921 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 35 [2024-11-09 08:02:10,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:10,921 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-11-09 08:02:10,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 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-09 08:02:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-11-09 08:02:10,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 08:02:10,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:10,922 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, 1] [2024-11-09 08:02:10,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 08:02:10,923 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:10,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:10,923 INFO L85 PathProgramCache]: Analyzing trace with hash 430148706, now seen corresponding path program 1 times [2024-11-09 08:02:10,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:10,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120459335] [2024-11-09 08:02:10,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:10,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:11,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:11,335 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-09 08:02:11,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:11,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120459335] [2024-11-09 08:02:11,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120459335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:11,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:11,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 08:02:11,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867785065] [2024-11-09 08:02:11,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:11,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 08:02:11,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:11,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 08:02:11,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:02:11,338 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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-09 08:02:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:11,671 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2024-11-09 08:02:11,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 08:02:11,671 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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 35 [2024-11-09 08:02:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:11,672 INFO L225 Difference]: With dead ends: 127 [2024-11-09 08:02:11,672 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 08:02:11,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 08:02:11,673 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 71 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:11,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 428 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:02:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 08:02:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 95. [2024-11-09 08:02:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 89 states have internal predecessors, (99), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-11-09 08:02:11,677 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 35 [2024-11-09 08:02:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:11,677 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-11-09 08:02:11,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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-09 08:02:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-11-09 08:02:11,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 08:02:11,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:11,678 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, 1, 1] [2024-11-09 08:02:11,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 08:02:11,678 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:11,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash 449706142, now seen corresponding path program 1 times [2024-11-09 08:02:11,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:11,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246316687] [2024-11-09 08:02:11,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:11,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:11,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:11,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:11,810 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-09 08:02:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:11,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246316687] [2024-11-09 08:02:11,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246316687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:11,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:11,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:02:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013457765] [2024-11-09 08:02:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:11,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 08:02:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 08:02:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:11,813 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-09 08:02:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:11,884 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2024-11-09 08:02:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 08:02:11,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 36 [2024-11-09 08:02:11,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:11,885 INFO L225 Difference]: With dead ends: 128 [2024-11-09 08:02:11,886 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 08:02:11,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 08:02:11,886 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 120 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:11,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 177 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 08:02:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 94. [2024-11-09 08:02:11,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 88 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2024-11-09 08:02:11,891 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 36 [2024-11-09 08:02:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:11,891 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2024-11-09 08:02:11,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-09 08:02:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2024-11-09 08:02:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 08:02:11,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:11,895 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, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:11,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 08:02:11,895 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:11,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:11,896 INFO L85 PathProgramCache]: Analyzing trace with hash 28664815, now seen corresponding path program 1 times [2024-11-09 08:02:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:11,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320101174] [2024-11-09 08:02:11,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:11,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:11,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:12,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:12,009 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-09 08:02:12,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:12,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320101174] [2024-11-09 08:02:12,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320101174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:12,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:12,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:02:12,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679731359] [2024-11-09 08:02:12,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:12,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:02:12,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:12,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:02:12,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:12,011 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-09 08:02:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:12,120 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2024-11-09 08:02:12,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:02:12,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 40 [2024-11-09 08:02:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:12,121 INFO L225 Difference]: With dead ends: 93 [2024-11-09 08:02:12,121 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 08:02:12,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:12,122 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 23 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:12,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 203 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 08:02:12,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 08:02:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 87 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2024-11-09 08:02:12,125 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 40 [2024-11-09 08:02:12,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:12,126 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2024-11-09 08:02:12,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-09 08:02:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2024-11-09 08:02:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 08:02:12,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:12,127 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, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:12,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 08:02:12,127 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:12,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash 28664816, now seen corresponding path program 1 times [2024-11-09 08:02:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:12,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321478978] [2024-11-09 08:02:12,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:12,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:12,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:12,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:12,581 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-09 08:02:12,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:12,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321478978] [2024-11-09 08:02:12,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321478978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:12,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:12,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 08:02:12,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340529893] [2024-11-09 08:02:12,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:12,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 08:02:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:12,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 08:02:12,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-09 08:02:12,584 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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-09 08:02:12,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:12,922 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2024-11-09 08:02:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 08:02:12,922 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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 40 [2024-11-09 08:02:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:12,923 INFO L225 Difference]: With dead ends: 123 [2024-11-09 08:02:12,923 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 08:02:12,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-09 08:02:12,924 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 61 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:12,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 438 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:02:12,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 08:02:12,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 98. [2024-11-09 08:02:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 92 states have internal predecessors, (102), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2024-11-09 08:02:12,928 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 40 [2024-11-09 08:02:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:12,928 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2024-11-09 08:02:12,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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-09 08:02:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2024-11-09 08:02:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 08:02:12,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:12,929 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, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:12,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 08:02:12,930 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:12,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:12,930 INFO L85 PathProgramCache]: Analyzing trace with hash 28650912, now seen corresponding path program 1 times [2024-11-09 08:02:12,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:12,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100044037] [2024-11-09 08:02:12,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:12,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:13,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:13,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:13,189 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-09 08:02:13,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:13,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100044037] [2024-11-09 08:02:13,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100044037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:13,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:13,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 08:02:13,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348855511] [2024-11-09 08:02:13,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:13,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 08:02:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:13,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 08:02:13,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:02:13,193 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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-09 08:02:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:13,460 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-11-09 08:02:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 08:02:13,461 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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 40 [2024-11-09 08:02:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:13,462 INFO L225 Difference]: With dead ends: 136 [2024-11-09 08:02:13,462 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 08:02:13,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-09 08:02:13,463 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 72 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:13,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 520 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 08:02:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2024-11-09 08:02:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 104 states have internal predecessors, (122), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2024-11-09 08:02:13,467 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 40 [2024-11-09 08:02:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:13,468 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2024-11-09 08:02:13,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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-09 08:02:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2024-11-09 08:02:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 08:02:13,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:13,469 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, 1] [2024-11-09 08:02:13,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 08:02:13,471 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:13,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:13,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1390382460, now seen corresponding path program 1 times [2024-11-09 08:02:13,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:13,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567705765] [2024-11-09 08:02:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:13,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:13,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:13,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:13,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 08:02:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 08:02:13,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:13,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567705765] [2024-11-09 08:02:13,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567705765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:13,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137221045] [2024-11-09 08:02:13,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:13,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:13,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:13,619 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-09 08:02:13,620 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-09 08:02:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:13,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:02:13,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 08:02:13,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137221045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:13,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:13,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-09 08:02:13,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416730864] [2024-11-09 08:02:13,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:13,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 08:02:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:13,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 08:02:13,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:13,867 INFO L87 Difference]: Start difference. First operand 110 states and 130 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-09 08:02:13,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:13,883 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2024-11-09 08:02:13,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 08:02:13,883 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 41 [2024-11-09 08:02:13,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:13,884 INFO L225 Difference]: With dead ends: 92 [2024-11-09 08:02:13,884 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 08:02:13,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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-09 08:02:13,885 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 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-09 08:02:13,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:02:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 08:02:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 08:02:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 88 states have internal predecessors, (99), 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-09 08:02:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2024-11-09 08:02:13,888 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 41 [2024-11-09 08:02:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:13,889 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2024-11-09 08:02:13,889 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-09 08:02:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2024-11-09 08:02:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 08:02:13,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:13,890 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:13,908 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-09 08:02:14,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:14,091 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:14,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:14,092 INFO L85 PathProgramCache]: Analyzing trace with hash 888178371, now seen corresponding path program 1 times [2024-11-09 08:02:14,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:14,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564623727] [2024-11-09 08:02:14,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:14,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:14,327 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-09 08:02:14,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:14,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564623727] [2024-11-09 08:02:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564623727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:14,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:14,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 08:02:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816578756] [2024-11-09 08:02:14,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:14,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 08:02:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:14,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 08:02:14,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:02:14,330 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-09 08:02:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:14,583 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2024-11-09 08:02:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 08:02:14,583 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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 41 [2024-11-09 08:02:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:14,584 INFO L225 Difference]: With dead ends: 115 [2024-11-09 08:02:14,584 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 08:02:14,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 08:02:14,586 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 53 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:14,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 418 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 08:02:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2024-11-09 08:02:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 91 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-09 08:02:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-11-09 08:02:14,591 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 41 [2024-11-09 08:02:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:14,591 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-11-09 08:02:14,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-09 08:02:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-11-09 08:02:14,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 08:02:14,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:14,592 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:14,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 08:02:14,593 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:14,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1777085136, now seen corresponding path program 1 times [2024-11-09 08:02:14,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:14,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004599672] [2024-11-09 08:02:14,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:14,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:15,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:15,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:15,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004599672] [2024-11-09 08:02:15,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004599672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:15,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528503925] [2024-11-09 08:02:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:15,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:15,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:15,493 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-09 08:02:15,494 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-09 08:02:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:15,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-09 08:02:15,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:15,948 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-09 08:02:16,081 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:16,082 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-09 08:02:16,161 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-09 08:02:16,238 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:02:16,238 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 32 treesize of output 31 [2024-11-09 08:02:16,349 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 08:02:16,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-09 08:02:16,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 08:02:16,609 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 56 treesize of output 32 [2024-11-09 08:02:16,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:16,666 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 36 treesize of output 16 [2024-11-09 08:02:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:16,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:16,818 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 26 treesize of output 18 [2024-11-09 08:02:16,821 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 29 treesize of output 17 [2024-11-09 08:02:16,915 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-09 08:02:16,915 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-09 08:02:17,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:17,104 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 21 treesize of output 22 [2024-11-09 08:02:17,109 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 122 treesize of output 110 [2024-11-09 08:02:17,118 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 20 treesize of output 16 [2024-11-09 08:02:17,132 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-09 08:02:17,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528503925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:17,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:17,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 36 [2024-11-09 08:02:17,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211946544] [2024-11-09 08:02:17,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:17,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 08:02:17,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:17,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 08:02:17,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2099, Unknown=2, NotChecked=0, Total=2256 [2024-11-09 08:02:17,297 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 31 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:18,225 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2024-11-09 08:02:18,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 08:02:18,226 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 31 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2024-11-09 08:02:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:18,227 INFO L225 Difference]: With dead ends: 100 [2024-11-09 08:02:18,227 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 08:02:18,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=212, Invalid=2756, Unknown=2, NotChecked=0, Total=2970 [2024-11-09 08:02:18,229 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 112 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:18,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 753 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 08:02:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 08:02:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-11-09 08:02:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 93 states have internal predecessors, (105), 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-09 08:02:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2024-11-09 08:02:18,232 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 42 [2024-11-09 08:02:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:18,232 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2024-11-09 08:02:18,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 31 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2024-11-09 08:02:18,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 08:02:18,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:18,233 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:18,252 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-09 08:02:18,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:18,434 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:18,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:18,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1777085137, now seen corresponding path program 1 times [2024-11-09 08:02:18,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:18,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623563463] [2024-11-09 08:02:18,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:18,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:19,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:19,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:19,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:19,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623563463] [2024-11-09 08:02:19,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623563463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:19,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672032669] [2024-11-09 08:02:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:19,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:19,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:19,613 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-09 08:02:19,614 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-09 08:02:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:19,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-09 08:02:19,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:19,907 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-09 08:02:19,911 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-09 08:02:20,159 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:02:20,160 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-09 08:02:20,178 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:20,178 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-09 08:02:20,280 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-09 08:02:20,285 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-09 08:02:20,384 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:02:20,384 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 57 treesize of output 50 [2024-11-09 08:02:20,394 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-09 08:02:20,532 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:02:20,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 08:02:20,548 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 08:02:20,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 08:02:20,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 08:02:20,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 08:02:20,888 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 11 treesize of output 3 [2024-11-09 08:02:20,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:20,892 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 60 treesize of output 20 [2024-11-09 08:02:20,992 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 8 treesize of output 4 [2024-11-09 08:02:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:20,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:21,242 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 58 treesize of output 42 [2024-11-09 08:02:21,246 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 53 treesize of output 33 [2024-11-09 08:02:21,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:21,593 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 23 treesize of output 24 [2024-11-09 08:02:21,596 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 138 treesize of output 126 [2024-11-09 08:02:21,603 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 24 treesize of output 20 [2024-11-09 08:02:21,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-09 08:02:21,618 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:02:21,619 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 43 treesize of output 1 [2024-11-09 08:02:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672032669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:21,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:21,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 39 [2024-11-09 08:02:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113163442] [2024-11-09 08:02:21,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:21,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 08:02:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:21,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 08:02:21,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2581, Unknown=1, NotChecked=0, Total=2756 [2024-11-09 08:02:21,812 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 40 states, 38 states have (on average 1.736842105263158) internal successors, (66), 34 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:22,843 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2024-11-09 08:02:22,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 08:02:22,843 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.736842105263158) internal successors, (66), 34 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2024-11-09 08:02:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:22,844 INFO L225 Difference]: With dead ends: 113 [2024-11-09 08:02:22,844 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 08:02:22,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=267, Invalid=3514, Unknown=1, NotChecked=0, Total=3782 [2024-11-09 08:02:22,846 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 134 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:22,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 787 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 08:02:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 08:02:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2024-11-09 08:02:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 93 states have internal predecessors, (104), 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-09 08:02:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-11-09 08:02:22,849 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 42 [2024-11-09 08:02:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:22,849 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-11-09 08:02:22,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.736842105263158) internal successors, (66), 34 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:02:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-11-09 08:02:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 08:02:22,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:22,850 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:22,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:23,051 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,SelfDestructingSolverStorable22 [2024-11-09 08:02:23,051 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:23,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1763725826, now seen corresponding path program 1 times [2024-11-09 08:02:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:23,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229000754] [2024-11-09 08:02:23,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:23,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,190 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-09 08:02:23,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:23,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229000754] [2024-11-09 08:02:23,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229000754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:23,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:23,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:02:23,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670208155] [2024-11-09 08:02:23,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:23,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:02:23,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:23,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:02:23,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:23,194 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 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-09 08:02:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:23,346 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-11-09 08:02:23,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:02:23,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 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-09 08:02:23,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:23,347 INFO L225 Difference]: With dead ends: 96 [2024-11-09 08:02:23,347 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 08:02:23,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:23,348 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 23 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 182 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-09 08:02:23,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 182 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:23,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 08:02:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 08:02:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.36) internal successors, (102), 92 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-09 08:02:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2024-11-09 08:02:23,353 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 42 [2024-11-09 08:02:23,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:23,353 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2024-11-09 08:02:23,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 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-09 08:02:23,354 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2024-11-09 08:02:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:02:23,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:23,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:23,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 08:02:23,355 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:23,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash -744935575, now seen corresponding path program 1 times [2024-11-09 08:02:23,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:23,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401639845] [2024-11-09 08:02:23,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:23,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:23,922 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-09 08:02:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:23,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401639845] [2024-11-09 08:02:23,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401639845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:23,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:23,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 08:02:23,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55868981] [2024-11-09 08:02:23,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:23,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 08:02:23,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:23,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 08:02:23,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-11-09 08:02:23,925 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 14 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-09 08:02:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:24,247 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-09 08:02:24,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 08:02:24,247 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 14 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 43 [2024-11-09 08:02:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:24,248 INFO L225 Difference]: With dead ends: 99 [2024-11-09 08:02:24,248 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 08:02:24,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-09 08:02:24,249 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 22 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:24,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 532 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 08:02:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 08:02:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-09 08:02:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.368421052631579) internal successors, (104), 93 states have internal predecessors, (104), 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-09 08:02:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-11-09 08:02:24,252 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 43 [2024-11-09 08:02:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:24,252 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-11-09 08:02:24,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 14 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-09 08:02:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-11-09 08:02:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:02:24,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:24,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:24,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 08:02:24,253 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:24,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:24,254 INFO L85 PathProgramCache]: Analyzing trace with hash -744935574, now seen corresponding path program 1 times [2024-11-09 08:02:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:24,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026240538] [2024-11-09 08:02:24,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:24,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:25,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 08:02:25,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:25,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026240538] [2024-11-09 08:02:25,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026240538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:25,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320545724] [2024-11-09 08:02:25,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:25,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:25,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:25,091 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-09 08:02:25,097 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-09 08:02:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:25,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 08:02:25,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:25,713 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 15 treesize of output 1 [2024-11-09 08:02:25,716 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 15 treesize of output 1 [2024-11-09 08:02:25,931 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 42 treesize of output 26 [2024-11-09 08:02:25,966 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 23 treesize of output 15 [2024-11-09 08:02:25,968 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 26 treesize of output 14 [2024-11-09 08:02:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:26,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:26,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 62 treesize of output 46 [2024-11-09 08:02:26,307 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 57 treesize of output 37 [2024-11-09 08:02:26,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:26,492 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 23 [2024-11-09 08:02:26,729 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-09 08:02:26,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320545724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:26,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:26,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 18] total 49 [2024-11-09 08:02:26,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296180676] [2024-11-09 08:02:26,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:26,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 08:02:26,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:26,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 08:02:26,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2290, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 08:02:26,731 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 50 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 43 states have internal predecessors, (94), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 08:02:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:27,733 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2024-11-09 08:02:27,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 08:02:27,734 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 43 states have internal predecessors, (94), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2024-11-09 08:02:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:27,734 INFO L225 Difference]: With dead ends: 109 [2024-11-09 08:02:27,734 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 08:02:27,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=302, Invalid=3730, Unknown=0, NotChecked=0, Total=4032 [2024-11-09 08:02:27,736 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 192 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:27,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 957 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 08:02:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 08:02:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2024-11-09 08:02:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.355263157894737) internal successors, (103), 93 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-09 08:02:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2024-11-09 08:02:27,739 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 43 [2024-11-09 08:02:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:27,740 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2024-11-09 08:02:27,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 43 states have internal predecessors, (94), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 08:02:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2024-11-09 08:02:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:02:27,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:27,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:27,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 08:02:27,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 08:02:27,941 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:27,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:27,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1159074138, now seen corresponding path program 1 times [2024-11-09 08:02:27,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:27,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010391445] [2024-11-09 08:02:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:27,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:28,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:28,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:28,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:28,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010391445] [2024-11-09 08:02:28,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010391445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:28,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962274424] [2024-11-09 08:02:28,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:28,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:28,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:28,233 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-09 08:02:28,235 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-09 08:02:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:28,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 08:02:28,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:28,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:28,631 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-09 08:02:28,633 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-09 08:02:28,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:28,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962274424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:28,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:28,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2024-11-09 08:02:28,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727458969] [2024-11-09 08:02:28,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:28,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:02:28,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:28,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:02:28,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-09 08:02:28,635 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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-09 08:02:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:28,744 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2024-11-09 08:02:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:02:28,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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 43 [2024-11-09 08:02:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:28,745 INFO L225 Difference]: With dead ends: 96 [2024-11-09 08:02:28,745 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 08:02:28,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-11-09 08:02:28,746 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 90 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:28,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 107 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 08:02:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 08:02:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 92 states have internal predecessors, (101), 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-09 08:02:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2024-11-09 08:02:28,749 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 43 [2024-11-09 08:02:28,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:28,749 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2024-11-09 08:02:28,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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-09 08:02:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2024-11-09 08:02:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 08:02:28,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:28,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:28,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:28,951 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,SelfDestructingSolverStorable26 [2024-11-09 08:02:28,952 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:28,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:28,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1376452779, now seen corresponding path program 1 times [2024-11-09 08:02:28,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:28,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913577231] [2024-11-09 08:02:28,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:28,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,172 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-09 08:02:29,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:29,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913577231] [2024-11-09 08:02:29,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913577231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:29,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:29,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 08:02:29,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052294995] [2024-11-09 08:02:29,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:29,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 08:02:29,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:29,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 08:02:29,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:02:29,175 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 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-09 08:02:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:29,372 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2024-11-09 08:02:29,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 08:02:29,372 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 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 45 [2024-11-09 08:02:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:29,373 INFO L225 Difference]: With dead ends: 119 [2024-11-09 08:02:29,373 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 08:02:29,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 08:02:29,374 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 53 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:29,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 463 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 08:02:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2024-11-09 08:02:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 99 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-09 08:02:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2024-11-09 08:02:29,377 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 45 [2024-11-09 08:02:29,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:29,377 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2024-11-09 08:02:29,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 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-09 08:02:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2024-11-09 08:02:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 08:02:29,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:29,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:29,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 08:02:29,378 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:29,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:29,379 INFO L85 PathProgramCache]: Analyzing trace with hash -279636685, now seen corresponding path program 1 times [2024-11-09 08:02:29,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:29,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950842308] [2024-11-09 08:02:29,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:29,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:29,630 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-09 08:02:29,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:29,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950842308] [2024-11-09 08:02:29,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950842308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:29,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:29,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 08:02:29,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511898701] [2024-11-09 08:02:29,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:29,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 08:02:29,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:29,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 08:02:29,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 08:02:29,633 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-09 08:02:29,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:29,879 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2024-11-09 08:02:29,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 08:02:29,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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 46 [2024-11-09 08:02:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:29,882 INFO L225 Difference]: With dead ends: 112 [2024-11-09 08:02:29,882 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 08:02:29,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 08:02:29,883 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 33 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:29,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 409 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:02:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 08:02:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2024-11-09 08:02:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 102 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-09 08:02:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2024-11-09 08:02:29,889 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 46 [2024-11-09 08:02:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:29,890 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2024-11-09 08:02:29,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-09 08:02:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2024-11-09 08:02:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 08:02:29,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:29,890 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:29,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 08:02:29,891 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:29,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:29,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1559486405, now seen corresponding path program 1 times [2024-11-09 08:02:29,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:29,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247261597] [2024-11-09 08:02:29,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:29,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:30,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:30,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:30,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:30,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247261597] [2024-11-09 08:02:30,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247261597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:30,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853664793] [2024-11-09 08:02:30,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:30,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:30,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:30,038 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-09 08:02:30,039 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-09 08:02:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:30,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 08:02:30,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:30,360 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-09 08:02:30,379 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-09 08:02:30,392 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-09 08:02:30,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:30,418 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-09 08:02:30,429 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-09 08:02:30,432 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-09 08:02:30,448 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:02:30,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 08:02:30,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:30,523 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-09 08:02:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2024-11-09 08:02:30,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:32,128 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_62| Int) (v_ArrVal_3611 Int) (|ULTIMATE.start_dll_circular_remove_first_#t~mem10#1.base| Int)) (or (= (select (store (store |c_#valid| |v_node_create_~temp~0#1.base_62| 1) |ULTIMATE.start_dll_circular_remove_first_#t~mem10#1.base| v_ArrVal_3611) |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |ULTIMATE.start_dll_circular_remove_first_#t~mem10#1.base| 1)))) is different from false [2024-11-09 08:02:32,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853664793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:32,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:32,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 10 [2024-11-09 08:02:32,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146486254] [2024-11-09 08:02:32,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:32,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:02:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:32,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:02:32,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=87, Unknown=3, NotChecked=60, Total=182 [2024-11-09 08:02:32,132 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 11 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:32,145 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|)))))) is different from true [2024-11-09 08:02:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:32,302 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2024-11-09 08:02:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 08:02:32,302 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2024-11-09 08:02:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:32,303 INFO L225 Difference]: With dead ends: 122 [2024-11-09 08:02:32,303 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 08:02:32,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=58, Invalid=136, Unknown=4, NotChecked=108, Total=306 [2024-11-09 08:02:32,304 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 163 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:32,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 156 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 211 Invalid, 0 Unknown, 263 Unchecked, 0.1s Time] [2024-11-09 08:02:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 08:02:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2024-11-09 08:02:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.313953488372093) internal successors, (113), 100 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-09 08:02:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2024-11-09 08:02:32,307 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 46 [2024-11-09 08:02:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:32,308 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2024-11-09 08:02:32,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 08:02:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2024-11-09 08:02:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 08:02:32,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:32,309 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:32,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 08:02:32,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:32,510 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:32,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash -78802515, now seen corresponding path program 1 times [2024-11-09 08:02:32,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:32,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938619032] [2024-11-09 08:02:32,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:32,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:32,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:32,644 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-09 08:02:32,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:32,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938619032] [2024-11-09 08:02:32,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938619032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:32,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:02:32,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:02:32,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046532641] [2024-11-09 08:02:32,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:32,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:02:32,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:32,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:02:32,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:02:32,647 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-09 08:02:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:32,756 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-11-09 08:02:32,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:02:32,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 47 [2024-11-09 08:02:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:32,758 INFO L225 Difference]: With dead ends: 103 [2024-11-09 08:02:32,758 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 08:02:32,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:02:32,759 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 17 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:32,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 178 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:32,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 08:02:32,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-09 08:02:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.302325581395349) internal successors, (112), 99 states have internal predecessors, (112), 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-09 08:02:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-11-09 08:02:32,761 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 47 [2024-11-09 08:02:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:32,762 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-11-09 08:02:32,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-09 08:02:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-11-09 08:02:32,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 08:02:32,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:32,762 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-09 08:02:32,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 08:02:32,763 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:32,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:32,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1099438322, now seen corresponding path program 1 times [2024-11-09 08:02:32,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:32,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303184951] [2024-11-09 08:02:32,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:33,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:33,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:33,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:33,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303184951] [2024-11-09 08:02:33,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303184951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:33,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442605201] [2024-11-09 08:02:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:33,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:33,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:33,684 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-09 08:02:33,686 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-09 08:02:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:33,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-09 08:02:33,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:33,982 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-09 08:02:34,061 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:34,062 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-09 08:02:34,113 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-09 08:02:34,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 08:02:34,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 08:02:34,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:34,222 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-09 08:02:34,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:34,547 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-09 08:02:34,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 41 [2024-11-09 08:02:34,683 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 16 treesize of output 8 [2024-11-09 08:02:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:34,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:34,866 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 8 treesize of output 4 [2024-11-09 08:02:34,909 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-09 08:02:34,917 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3921 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3921) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2024-11-09 08:02:34,992 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| Int) (v_ArrVal_3920 (Array Int Int)) (v_ArrVal_3921 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3920) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3921) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_34| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))) is different from false [2024-11-09 08:02:35,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:35,013 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 27 treesize of output 28 [2024-11-09 08:02:35,019 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 85 treesize of output 81 [2024-11-09 08:02:35,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:35,032 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 94 treesize of output 98 [2024-11-09 08:02:35,038 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 98 treesize of output 94 [2024-11-09 08:02:35,047 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 85 treesize of output 83 [2024-11-09 08:02:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 08:02:35,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442605201] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:35,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:35,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 25] total 55 [2024-11-09 08:02:35,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105654284] [2024-11-09 08:02:35,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:35,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-09 08:02:35,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:35,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-09 08:02:35,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2571, Unknown=18, NotChecked=206, Total=2970 [2024-11-09 08:02:35,643 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 55 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 48 states have internal predecessors, (95), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 08:02:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:36,872 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2024-11-09 08:02:36,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 08:02:36,872 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 48 states have internal predecessors, (95), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 47 [2024-11-09 08:02:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:36,873 INFO L225 Difference]: With dead ends: 85 [2024-11-09 08:02:36,873 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 08:02:36,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=287, Invalid=3735, Unknown=18, NotChecked=250, Total=4290 [2024-11-09 08:02:36,875 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 54 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:36,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1097 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1145 Invalid, 0 Unknown, 84 Unchecked, 0.8s Time] [2024-11-09 08:02:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 08:02:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-09 08:02:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.234375) internal successors, (79), 77 states have internal predecessors, (79), 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-09 08:02:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2024-11-09 08:02:36,877 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 47 [2024-11-09 08:02:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:36,877 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2024-11-09 08:02:36,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 48 states have internal predecessors, (95), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 08:02:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2024-11-09 08:02:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 08:02:36,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:36,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:36,898 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-09 08:02:37,078 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,SelfDestructingSolverStorable31 [2024-11-09 08:02:37,079 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:37,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:37,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1852089462, now seen corresponding path program 1 times [2024-11-09 08:02:37,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:37,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297623272] [2024-11-09 08:02:37,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:37,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:37,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:37,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:37,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:37,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297623272] [2024-11-09 08:02:37,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297623272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:37,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830073434] [2024-11-09 08:02:37,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:37,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:37,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:37,425 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-09 08:02:37,429 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-09 08:02:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:37,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 08:02:37,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:37,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:37,860 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-09 08:02:37,862 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-09 08:02:37,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 08:02:37,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830073434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:02:37,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 08:02:37,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2024-11-09 08:02:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644668885] [2024-11-09 08:02:37,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:02:37,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:02:37,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:37,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:02:37,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-09 08:02:37,866 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 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-09 08:02:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:37,997 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2024-11-09 08:02:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:02:37,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 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 48 [2024-11-09 08:02:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:37,998 INFO L225 Difference]: With dead ends: 80 [2024-11-09 08:02:37,998 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 08:02:37,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-11-09 08:02:37,999 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 75 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:37,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 127 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:37,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 08:02:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 08:02:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.21875) internal successors, (78), 76 states have internal predecessors, (78), 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-09 08:02:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2024-11-09 08:02:38,004 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 48 [2024-11-09 08:02:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:38,005 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2024-11-09 08:02:38,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 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-09 08:02:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2024-11-09 08:02:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 08:02:38,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:38,006 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, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:38,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 08:02:38,206 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,SelfDestructingSolverStorable32 [2024-11-09 08:02:38,207 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:38,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:38,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1739178274, now seen corresponding path program 1 times [2024-11-09 08:02:38,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:38,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738395068] [2024-11-09 08:02:38,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:38,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:39,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:39,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:39,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738395068] [2024-11-09 08:02:39,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738395068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:39,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128682996] [2024-11-09 08:02:39,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:39,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:39,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:39,375 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-09 08:02:39,376 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-09 08:02:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:39,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-09 08:02:39,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:39,672 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-09 08:02:39,848 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:39,849 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-09 08:02:39,915 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-09 08:02:39,918 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-09 08:02:39,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 08:02:39,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 08:02:40,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 08:02:40,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 08:02:40,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:40,117 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-09 08:02:40,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:40,123 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 35 treesize of output 26 [2024-11-09 08:02:40,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:40,591 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-09 08:02:40,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 46 [2024-11-09 08:02:40,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:40,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:40,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-09 08:02:41,096 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 45 treesize of output 37 [2024-11-09 08:02:41,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:41,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 9 [2024-11-09 08:02:41,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-09 08:02:41,323 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 17 treesize of output 9 [2024-11-09 08:02:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:41,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:41,935 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 8 treesize of output 4 [2024-11-09 08:02:42,060 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 56 treesize of output 32 [2024-11-09 08:02:42,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:42,276 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 60 treesize of output 64 [2024-11-09 08:02:42,330 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_4339 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4339) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store .cse0 .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))) (or (and (forall ((v_ArrVal_4339 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4339) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_4339 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4339) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (forall ((v_ArrVal_4340 (Array Int Int)) (v_ArrVal_4341 Int)) (= (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4340) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_4341) 0) 0))))) is different from false [2024-11-09 08:02:42,646 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4340 (Array Int Int)) (v_ArrVal_4337 (Array Int Int)) (v_ArrVal_4338 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| Int) (v_ArrVal_4341 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| 4))) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4338) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4340) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 v_ArrVal_4341) 0) 0) (forall ((v_ArrVal_4339 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4337) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_4337 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_4339 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4337) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select .cse1 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store .cse1 (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))))) (or (forall ((v_ArrVal_4337 (Array Int Int)) (v_ArrVal_4339 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4337) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (forall ((v_ArrVal_4340 (Array Int Int)) (v_ArrVal_4338 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4338) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4340) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)))) is different from false [2024-11-09 08:02:42,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:42,692 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 26 treesize of output 27 [2024-11-09 08:02:42,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:42,700 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 27 treesize of output 28 [2024-11-09 08:02:42,707 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 80 treesize of output 76 [2024-11-09 08:02:42,713 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 94 treesize of output 90 [2024-11-09 08:02:42,722 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 54 [2024-11-09 08:02:42,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:42,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 68 [2024-11-09 08:02:42,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 165 [2024-11-09 08:02:42,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:42,770 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 94 treesize of output 98 [2024-11-09 08:02:42,785 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 85 treesize of output 83 [2024-11-09 08:02:42,794 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 96 treesize of output 92 [2024-11-09 08:02:42,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:42,903 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 21 treesize of output 22 [2024-11-09 08:02:42,905 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:42,906 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:42,908 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 16 treesize of output 8 [2024-11-09 08:02:42,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:42,915 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 26 treesize of output 27 [2024-11-09 08:02:42,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:42,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:42,920 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 21 treesize of output 17 [2024-11-09 08:02:42,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:42,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 08:02:42,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:42,931 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 48 treesize of output 40 [2024-11-09 08:02:42,934 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:42,934 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:42,936 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 28 treesize of output 22 [2024-11-09 08:02:42,939 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:42,941 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 17 treesize of output 11 [2024-11-09 08:02:43,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128682996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:43,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:43,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 51 [2024-11-09 08:02:43,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787151604] [2024-11-09 08:02:43,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:43,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 08:02:43,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:43,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 08:02:43,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4429, Unknown=22, NotChecked=270, Total=4970 [2024-11-09 08:02:43,106 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 52 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 46 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:44,548 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2024-11-09 08:02:44,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 08:02:44,549 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 46 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2024-11-09 08:02:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:44,549 INFO L225 Difference]: With dead ends: 114 [2024-11-09 08:02:44,550 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 08:02:44,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=403, Invalid=6225, Unknown=22, NotChecked=322, Total=6972 [2024-11-09 08:02:44,552 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 99 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:44,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 803 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 08:02:44,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 08:02:44,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2024-11-09 08:02:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 83 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-09 08:02:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2024-11-09 08:02:44,555 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 53 [2024-11-09 08:02:44,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:44,555 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2024-11-09 08:02:44,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 46 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2024-11-09 08:02:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 08:02:44,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:44,556 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, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:44,572 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-09 08:02:44,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:44,757 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:44,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1739178273, now seen corresponding path program 1 times [2024-11-09 08:02:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:44,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565382978] [2024-11-09 08:02:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:45,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:46,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:46,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:46,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565382978] [2024-11-09 08:02:46,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565382978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:46,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345158682] [2024-11-09 08:02:46,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:46,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:46,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:46,213 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-09 08:02:46,214 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-09 08:02:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:46,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-09 08:02:46,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:46,542 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-09 08:02:46,548 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-09 08:02:46,854 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:46,854 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-09 08:02:46,859 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (or (exists ((|v_#length_BEFORE_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_12| |c_#length|))) (and (<= 12 (select |v_#length_BEFORE_CALL_12| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#length| (store |v_#length_BEFORE_CALL_12| .cse0 (select |c_#length| .cse0)))))) (< 11 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0)) is different from false [2024-11-09 08:02:46,861 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (or (exists ((|v_#length_BEFORE_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_12| |c_#length|))) (and (<= 12 (select |v_#length_BEFORE_CALL_12| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#length| (store |v_#length_BEFORE_CALL_12| .cse0 (select |c_#length| .cse0)))))) (< 11 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0)) is different from true [2024-11-09 08:02:46,908 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-09 08:02:46,914 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-09 08:02:46,991 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:02:46,992 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 57 treesize of output 50 [2024-11-09 08:02:47,001 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-09 08:02:47,116 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:02:47,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 08:02:47,133 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 08:02:47,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 08:02:47,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:47,194 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-09 08:02:47,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:47,199 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 35 treesize of output 26 [2024-11-09 08:02:47,589 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-11-09 08:02:47,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-09 08:02:47,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:47,619 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-09 08:02:47,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 46 [2024-11-09 08:02:48,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 08:02:48,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-09 08:02:48,245 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 17 treesize of output 9 [2024-11-09 08:02:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:48,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:48,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:48,850 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 130 treesize of output 129 [2024-11-09 08:02:48,968 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 44 treesize of output 28 [2024-11-09 08:02:49,196 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_4569 Int) (v_ArrVal_4566 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4566) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_4569) 0))) (forall ((v_ArrVal_4569 Int) (v_ArrVal_4566 (Array Int Int)) (v_ArrVal_4567 (Array Int Int))) (<= (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4566) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_4569) 0) 4) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4567) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2024-11-09 08:02:49,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:49,918 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 26 treesize of output 27 [2024-11-09 08:02:49,921 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 178 treesize of output 172 [2024-11-09 08:02:49,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:49,934 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 54 treesize of output 58 [2024-11-09 08:02:49,942 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 57 treesize of output 55 [2024-11-09 08:02:49,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-11-09 08:02:50,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:50,054 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 53 treesize of output 54 [2024-11-09 08:02:50,057 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:50,057 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:50,059 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 48 treesize of output 44 [2024-11-09 08:02:50,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:50,067 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 37 treesize of output 38 [2024-11-09 08:02:50,069 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:50,070 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:50,072 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 32 treesize of output 28 [2024-11-09 08:02:50,075 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:50,077 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 23 treesize of output 19 [2024-11-09 08:02:50,079 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:02:50,081 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 16 treesize of output 12 [2024-11-09 08:02:50,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345158682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:50,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:02:50,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 49 [2024-11-09 08:02:50,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420610864] [2024-11-09 08:02:50,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:50,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 08:02:50,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:50,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 08:02:50,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4129, Unknown=91, NotChecked=262, Total=4692 [2024-11-09 08:02:50,393 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 50 states, 49 states have (on average 1.836734693877551) internal successors, (90), 44 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:50,821 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (or (exists ((|v_#length_BEFORE_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_12| |c_#length|))) (and (<= 12 (select |v_#length_BEFORE_CALL_12| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#length| (store |v_#length_BEFORE_CALL_12| .cse0 (select |c_#length| .cse0)))))) (< 11 .cse1)) (= .cse1 12) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0))) is different from false [2024-11-09 08:02:50,823 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (or (exists ((|v_#length_BEFORE_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_12| |c_#length|))) (and (<= 12 (select |v_#length_BEFORE_CALL_12| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= |c_#length| (store |v_#length_BEFORE_CALL_12| .cse0 (select |c_#length| .cse0)))))) (< 11 .cse1)) (= .cse1 12) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0))) is different from true [2024-11-09 08:02:52,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:52,580 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2024-11-09 08:02:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 08:02:52,581 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.836734693877551) internal successors, (90), 44 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2024-11-09 08:02:52,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:52,581 INFO L225 Difference]: With dead ends: 115 [2024-11-09 08:02:52,582 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 08:02:52,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=370, Invalid=6844, Unknown=108, NotChecked=510, Total=7832 [2024-11-09 08:02:52,584 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 109 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:52,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1091 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1841 Invalid, 0 Unknown, 164 Unchecked, 1.0s Time] [2024-11-09 08:02:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 08:02:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 87. [2024-11-09 08:02:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 83 states have internal predecessors, (86), 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-09 08:02:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2024-11-09 08:02:52,586 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 53 [2024-11-09 08:02:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:52,587 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2024-11-09 08:02:52,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.836734693877551) internal successors, (90), 44 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2024-11-09 08:02:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 08:02:52,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:52,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:02:52,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 08:02:52,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:52,789 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:52,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1920046529, now seen corresponding path program 1 times [2024-11-09 08:02:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:52,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587257801] [2024-11-09 08:02:52,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:52,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:52,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:52,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587257801] [2024-11-09 08:02:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587257801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559104218] [2024-11-09 08:02:52,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:52,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:52,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:52,904 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-09 08:02:52,905 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-09 08:02:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:53,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 08:02:53,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:53,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:53,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559104218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:53,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:53,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-09 08:02:53,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486222360] [2024-11-09 08:02:53,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:53,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 08:02:53,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:53,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 08:02:53,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:02:53,372 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 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-09 08:02:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:53,449 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2024-11-09 08:02:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:02:53,450 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 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 54 [2024-11-09 08:02:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:53,450 INFO L225 Difference]: With dead ends: 87 [2024-11-09 08:02:53,450 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 08:02:53,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 08:02:53,451 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 71 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:53,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 241 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:02:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 08:02:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 08:02:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 83 states have internal predecessors, (85), 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-09 08:02:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2024-11-09 08:02:53,454 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 54 [2024-11-09 08:02:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:53,454 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2024-11-09 08:02:53,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 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-09 08:02:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2024-11-09 08:02:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 08:02:53,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:53,455 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 08:02:53,475 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-09 08:02:53,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-09 08:02:53,656 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:53,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:53,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1982838675, now seen corresponding path program 1 times [2024-11-09 08:02:53,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:53,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034596279] [2024-11-09 08:02:53,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:53,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:53,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:53,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:53,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:53,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034596279] [2024-11-09 08:02:53,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034596279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:53,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375420677] [2024-11-09 08:02:53,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:53,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:53,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:53,994 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-09 08:02:53,996 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-09 08:02:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:54,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-09 08:02:54,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:54,355 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-09 08:02:54,469 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:54,469 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-09 08:02:54,529 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-09 08:02:54,573 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 08:02:54,573 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 32 treesize of output 31 [2024-11-09 08:02:54,638 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 08:02:54,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-09 08:02:54,646 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 19 [2024-11-09 08:02:54,997 INFO L349 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2024-11-09 08:02:54,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 68 [2024-11-09 08:02:55,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 08:02:55,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-11-09 08:02:55,611 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 23 treesize of output 15 [2024-11-09 08:02:55,612 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 26 treesize of output 14 [2024-11-09 08:02:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:02:55,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:02:56,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:02:56,003 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 39 treesize of output 43 [2024-11-09 08:02:56,569 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-09 08:02:56,570 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 67 treesize of output 51 [2024-11-09 08:02:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 08:02:56,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375420677] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:02:56,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:02:56,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 32, 11] total 48 [2024-11-09 08:02:56,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358277797] [2024-11-09 08:02:56,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:02:56,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-09 08:02:56,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:02:56,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 08:02:56,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2148, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 08:02:56,624 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 49 states, 47 states have (on average 2.6595744680851063) internal successors, (125), 45 states have internal predecessors, (125), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:02:57,680 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2024-11-09 08:02:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-09 08:02:57,680 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 2.6595744680851063) internal successors, (125), 45 states have internal predecessors, (125), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 58 [2024-11-09 08:02:57,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:02:57,681 INFO L225 Difference]: With dead ends: 120 [2024-11-09 08:02:57,681 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 08:02:57,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=442, Invalid=3464, Unknown=0, NotChecked=0, Total=3906 [2024-11-09 08:02:57,682 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 264 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 08:02:57,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 824 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 08:02:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 08:02:57,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 96. [2024-11-09 08:02:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.225) internal successors, (98), 92 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-09 08:02:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-09 08:02:57,685 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 58 [2024-11-09 08:02:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:02:57,686 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-09 08:02:57,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 2.6595744680851063) internal successors, (125), 45 states have internal predecessors, (125), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 08:02:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-09 08:02:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 08:02:57,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:02:57,687 INFO L215 NwaCegarLoop]: trace histogram [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-09 08:02:57,707 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-09 08:02:57,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-09 08:02:57,888 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:02:57,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:02:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1982824771, now seen corresponding path program 1 times [2024-11-09 08:02:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:02:57,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770697148] [2024-11-09 08:02:57,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:57,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:02:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:58,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:02:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:02:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:02:58,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:02:58,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770697148] [2024-11-09 08:02:58,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770697148] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:02:58,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5922879] [2024-11-09 08:02:58,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:02:58,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:02:58,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:02:58,890 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-09 08:02:58,891 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-09 08:02:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:02:59,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-09 08:02:59,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:02:59,265 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-09 08:02:59,440 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:02:59,440 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-09 08:02:59,517 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-09 08:02:59,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 08:02:59,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 08:02:59,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:02:59,705 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-09 08:02:59,981 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-11-09 08:02:59,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-09 08:03:00,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 08:03:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:00,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:00,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:00,988 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 63 treesize of output 62 [2024-11-09 08:03: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 20 treesize of output 12 [2024-11-09 08:03:01,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:01,535 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 26 treesize of output 27 [2024-11-09 08:03:01,538 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 162 treesize of output 156 [2024-11-09 08:03:01,545 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 47 treesize of output 45 [2024-11-09 08:03:01,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:01,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 68 [2024-11-09 08:03:01,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-11-09 08:03:01,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5922879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:01,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 08:03:01,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 51 [2024-11-09 08:03:01,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130145987] [2024-11-09 08:03:01,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 08:03:01,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 08:03:01,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:03:01,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 08:03:01,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4660, Unknown=64, NotChecked=0, Total=4970 [2024-11-09 08:03:01,870 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 52 states, 50 states have (on average 2.0) internal successors, (100), 46 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:03:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:03:03,453 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2024-11-09 08:03:03,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 08:03:03,454 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.0) internal successors, (100), 46 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2024-11-09 08:03:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:03:03,455 INFO L225 Difference]: With dead ends: 134 [2024-11-09 08:03:03,455 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 08:03:03,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=471, Invalid=8201, Unknown=70, NotChecked=0, Total=8742 [2024-11-09 08:03:03,456 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 201 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 08:03:03,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1352 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1837 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 08:03:03,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 08:03:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111. [2024-11-09 08:03:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 107 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-09 08:03:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2024-11-09 08:03:03,459 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 58 [2024-11-09 08:03:03,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:03:03,460 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2024-11-09 08:03:03,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.0) internal successors, (100), 46 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 08:03:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2024-11-09 08:03:03,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 08:03:03,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:03:03,461 INFO L215 NwaCegarLoop]: trace histogram [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-09 08:03:03,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-09 08:03:03,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-09 08:03:03,662 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-09 08:03:03,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:03:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1338025856, now seen corresponding path program 1 times [2024-11-09 08:03:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:03:03,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382810762] [2024-11-09 08:03:03,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:03,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:03:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:04,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 08:03:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:04,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 08:03:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:03:04,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:03:04,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382810762] [2024-11-09 08:03:04,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382810762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:03:04,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792570680] [2024-11-09 08:03:04,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:03:04,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:03:04,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:03:04,790 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 08:03:04,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 08:03:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:03:05,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-09 08:03:05,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:03:05,205 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-09 08:03:05,276 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-09 08:03:05,334 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 08:03:05,335 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-09 08:03:05,412 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-09 08:03:05,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 08:03:05,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 08:03:05,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:05,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-09 08:03:05,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:03:05,855 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-09 08:03:05,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 46 [2024-11-09 08:03:06,085 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 47 treesize of output 39 [2024-11-09 08:03:06,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2024-11-09 08:03:06,234 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 17 treesize of output 9 [2024-11-09 08:03:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:03:06,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:03:06,636 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 8 treesize of output 4 [2024-11-09 08:03:06,716 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 20 treesize of output 12 [2024-11-09 08:03:06,801 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5447 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_47| Int)) (or (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5447) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_47| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_47| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2024-11-09 08:03:06,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:06,907 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 26 treesize of output 27 [2024-11-09 08:03:06,909 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 79 treesize of output 75 [2024-11-09 08:03:06,915 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 50 [2024-11-09 08:03:06,920 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 118 treesize of output 114 [2024-11-09 08:03:06,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:03:06,930 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 71 treesize of output 75