./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_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 b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:00:21,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:00:22,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:00:22,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:00:22,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:00:22,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:00:22,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:00:22,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:00:22,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:00:22,115 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:00:22,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:00:22,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:00:22,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:00:22,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:00:22,117 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:00:22,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:00:22,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:00:22,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:00:22,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:00:22,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:00:22,119 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:00:22,121 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:00:22,122 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:00:22,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:00:22,122 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:00:22,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:00:22,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:00:22,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:00:22,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:00:22,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:00:22,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:00:22,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:00:22,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:00:22,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:00:22,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:00:22,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:00:22,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:00:22,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:00:22,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:00:22,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:00:22,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:00:22,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:00:22,128 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 -> b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 [2024-10-13 11:00:22,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:00:22,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:00:22,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:00:22,416 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:00:22,417 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:00:22,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2024-10-13 11:00:23,907 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:00:24,192 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:00:24,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2024-10-13 11:00:24,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7fb73636/45926f0160194ddab94eaf0393fb086a/FLAG2b648e4c0 [2024-10-13 11:00:24,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7fb73636/45926f0160194ddab94eaf0393fb086a [2024-10-13 11:00:24,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:00:24,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:00:24,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:00:24,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:00:24,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:00:24,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c505627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24, skipping insertion in model container [2024-10-13 11:00:24,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:00:24,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:00:24,658 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:00:24,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:00:24,750 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:00:24,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24 WrapperNode [2024-10-13 11:00:24,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:00:24,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:00:24,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:00:24,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:00:24,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,802 INFO L138 Inliner]: procedures = 126, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 83 [2024-10-13 11:00:24,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:00:24,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:00:24,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:00:24,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:00:24,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,840 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 5, 6]. 46 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2024-10-13 11:00:24,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:00:24,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:00:24,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:00:24,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:00:24,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24" (1/1) ... [2024-10-13 11:00:24,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:00:24,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:24,910 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-10-13 11:00:24,916 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-10-13 11:00:24,968 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-13 11:00:24,968 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-13 11:00:24,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 11:00:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 11:00:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 11:00:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:00:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:00:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:00:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:00:24,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:00:24,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:00:24,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:00:24,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:00:24,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:00:24,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:00:24,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 11:00:24,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 11:00:24,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 11:00:24,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 11:00:24,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 11:00:24,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 11:00:24,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:00:24,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:00:25,126 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:00:25,129 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:00:25,156 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-13 11:00:25,455 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-10-13 11:00:25,455 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:00:25,491 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:00:25,492 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 11:00:25,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:00:25 BoogieIcfgContainer [2024-10-13 11:00:25,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:00:25,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:00:25,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:00:25,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:00:25,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:00:24" (1/3) ... [2024-10-13 11:00:25,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a90ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:00:25, skipping insertion in model container [2024-10-13 11:00:25,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:24" (2/3) ... [2024-10-13 11:00:25,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a90ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:00:25, skipping insertion in model container [2024-10-13 11:00:25,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:00:25" (3/3) ... [2024-10-13 11:00:25,500 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2024-10-13 11:00:25,514 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:00:25,514 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-10-13 11:00:25,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:00:25,566 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;@225db4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:00:25,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-10-13 11:00:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 53 states have internal predecessors, (62), 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-10-13 11:00:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 11:00:25,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:25,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 11:00:25,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:25,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:25,590 INFO L85 PathProgramCache]: Analyzing trace with hash 4514524, now seen corresponding path program 1 times [2024-10-13 11:00:25,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:25,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819798854] [2024-10-13 11:00:25,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:25,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:25,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:25,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819798854] [2024-10-13 11:00:25,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819798854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:00:25,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:00:25,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:00:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979084940] [2024-10-13 11:00:25,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:00:25,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:00:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:25,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:00:25,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:00:25,888 INFO L87 Difference]: Start difference. First operand has 55 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 53 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:25,997 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-10-13 11:00:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:00:26,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 11:00:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:26,005 INFO L225 Difference]: With dead ends: 51 [2024-10-13 11:00:26,005 INFO L226 Difference]: Without dead ends: 47 [2024-10-13 11:00:26,007 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-10-13 11:00:26,010 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:26,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:00:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-13 11:00:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-13 11:00:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 2.0) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-10-13 11:00:26,071 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 4 [2024-10-13 11:00:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:26,077 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-10-13 11:00:26,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-10-13 11:00:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 11:00:26,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:26,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 11:00:26,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 11:00:26,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:26,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:26,079 INFO L85 PathProgramCache]: Analyzing trace with hash 4514525, now seen corresponding path program 1 times [2024-10-13 11:00:26,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:26,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721157688] [2024-10-13 11:00:26,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:26,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:26,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:26,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721157688] [2024-10-13 11:00:26,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721157688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:00:26,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:00:26,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:00:26,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541710623] [2024-10-13 11:00:26,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:00:26,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:00:26,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:26,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:00:26,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:00:26,236 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:26,283 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2024-10-13 11:00:26,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:00:26,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 11:00:26,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:26,284 INFO L225 Difference]: With dead ends: 44 [2024-10-13 11:00:26,286 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 11:00:26,287 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-10-13 11:00:26,288 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:26,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:00:26,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 11:00:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-13 11:00:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.88) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2024-10-13 11:00:26,297 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 4 [2024-10-13 11:00:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:26,297 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2024-10-13 11:00:26,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2024-10-13 11:00:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 11:00:26,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:26,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 11:00:26,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 11:00:26,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:26,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:26,300 INFO L85 PathProgramCache]: Analyzing trace with hash 139988715, now seen corresponding path program 1 times [2024-10-13 11:00:26,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:26,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591873935] [2024-10-13 11:00:26,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:26,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:26,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591873935] [2024-10-13 11:00:26,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591873935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:00:26,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:00:26,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:00:26,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267869163] [2024-10-13 11:00:26,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:00:26,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:00:26,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:26,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:00:26,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:00:26,375 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:26,402 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-10-13 11:00:26,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:00:26,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 11:00:26,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:26,404 INFO L225 Difference]: With dead ends: 54 [2024-10-13 11:00:26,404 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 11:00:26,405 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-10-13 11:00:26,406 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:26,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:00:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 11:00:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2024-10-13 11:00:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-10-13 11:00:26,413 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 5 [2024-10-13 11:00:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:26,413 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-10-13 11:00:26,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-10-13 11:00:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 11:00:26,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:26,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:26,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 11:00:26,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1155614624, now seen corresponding path program 1 times [2024-10-13 11:00:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879431312] [2024-10-13 11:00:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:26,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:26,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879431312] [2024-10-13 11:00:26,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879431312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:00:26,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:00:26,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:00:26,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34309716] [2024-10-13 11:00:26,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:00:26,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:00:26,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:26,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:00:26,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:00:26,512 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:26,548 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2024-10-13 11:00:26,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:00:26,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-13 11:00:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:26,550 INFO L225 Difference]: With dead ends: 50 [2024-10-13 11:00:26,550 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 11:00:26,550 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-10-13 11:00:26,551 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:26,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:00:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 11:00:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-13 11:00:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-10-13 11:00:26,556 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 8 [2024-10-13 11:00:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:26,557 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-10-13 11:00:26,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-10-13 11:00:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:00:26,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:26,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:26,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 11:00:26,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:26,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:26,559 INFO L85 PathProgramCache]: Analyzing trace with hash 723675860, now seen corresponding path program 1 times [2024-10-13 11:00:26,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:26,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215875951] [2024-10-13 11:00:26,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:26,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:26,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:26,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215875951] [2024-10-13 11:00:26,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215875951] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:26,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284705788] [2024-10-13 11:00:26,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:26,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:26,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:26,662 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-10-13 11:00:26,664 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-10-13 11:00:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:26,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:00:26,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:26,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:26,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284705788] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:26,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:26,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-10-13 11:00:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116284177] [2024-10-13 11:00:26,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:26,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:00:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:26,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:00:26,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:00:26,846 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:26,879 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-10-13 11:00:26,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:00:26,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 11:00:26,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:26,880 INFO L225 Difference]: With dead ends: 52 [2024-10-13 11:00:26,880 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 11:00:26,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:00:26,881 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:26,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:00:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 11:00:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 11:00:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2024-10-13 11:00:26,889 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 12 [2024-10-13 11:00:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:26,889 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-10-13 11:00:26,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2024-10-13 11:00:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 11:00:26,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:26,892 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 11:00:26,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 11:00:27,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:27,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:27,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:27,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1440507863, now seen corresponding path program 1 times [2024-10-13 11:00:27,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:27,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040436507] [2024-10-13 11:00:27,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:27,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:27,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:27,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040436507] [2024-10-13 11:00:27,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040436507] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:27,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711268532] [2024-10-13 11:00:27,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:27,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:27,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:27,336 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-10-13 11:00:27,338 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-10-13 11:00:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:27,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 11:00:27,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:27,568 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-10-13 11:00:27,604 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 11:00:27,604 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-10-13 11:00:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:27,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:27,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711268532] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:27,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:27,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-10-13 11:00:27,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212146247] [2024-10-13 11:00:27,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:27,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:00:27,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:27,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:00:27,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:00:27,662 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:27,748 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-10-13 11:00:27,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:00:27,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 11:00:27,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:27,750 INFO L225 Difference]: With dead ends: 51 [2024-10-13 11:00:27,750 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 11:00:27,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:00:27,751 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:27,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:00:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 11:00:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-13 11:00:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-10-13 11:00:27,755 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 15 [2024-10-13 11:00:27,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:27,755 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-10-13 11:00:27,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-10-13 11:00:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 11:00:27,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:27,756 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 11:00:27,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 11:00:27,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 11:00:27,961 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:27,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:27,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1440507864, now seen corresponding path program 1 times [2024-10-13 11:00:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:27,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195132653] [2024-10-13 11:00:27,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:27,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:28,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195132653] [2024-10-13 11:00:28,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195132653] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:28,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805819610] [2024-10-13 11:00:28,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:28,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:28,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:28,189 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-10-13 11:00:28,191 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-10-13 11:00:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:28,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 11:00:28,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:28,339 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-10-13 11:00:28,346 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-10-13 11:00:28,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:28,462 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-10-13 11:00:28,473 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:00:28,473 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-10-13 11:00:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:28,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:28,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805819610] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:28,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:28,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-10-13 11:00:28,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009858507] [2024-10-13 11:00:28,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:28,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 11:00:28,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:28,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 11:00:28,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-13 11:00:28,844 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:29,057 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2024-10-13 11:00:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:00:29,058 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 11:00:29,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:29,058 INFO L225 Difference]: With dead ends: 50 [2024-10-13 11:00:29,058 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 11:00:29,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-13 11:00:29,059 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:29,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 147 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:00:29,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 11:00:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-13 11:00:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.606060606060606) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-10-13 11:00:29,069 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 15 [2024-10-13 11:00:29,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:29,069 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-10-13 11:00:29,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:29,069 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-10-13 11:00:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 11:00:29,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:29,070 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 11:00:29,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 11:00:29,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:29,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:29,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:29,271 INFO L85 PathProgramCache]: Analyzing trace with hash -939686197, now seen corresponding path program 2 times [2024-10-13 11:00:29,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:29,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401935786] [2024-10-13 11:00:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:29,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:29,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401935786] [2024-10-13 11:00:29,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401935786] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:29,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677967890] [2024-10-13 11:00:29,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:00:29,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:29,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:29,346 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-10-13 11:00:29,347 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-10-13 11:00:29,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 11:00:29,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:00:29,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:00:29,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:00:29,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:00:29,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677967890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:00:29,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:00:29,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 11:00:29,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993157911] [2024-10-13 11:00:29,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:00:29,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:00:29,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:29,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:00:29,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:00:29,464 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:29,487 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2024-10-13 11:00:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:00:29,488 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-13 11:00:29,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:29,489 INFO L225 Difference]: With dead ends: 73 [2024-10-13 11:00:29,489 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 11:00:29,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:00:29,490 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 25 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:29,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:00:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 11:00:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2024-10-13 11:00:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-10-13 11:00:29,498 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 19 [2024-10-13 11:00:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:29,498 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-10-13 11:00:29,498 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-10-13 11:00:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 11:00:29,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:29,499 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 11:00:29,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 11:00:29,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:29,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:29,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash -939686170, now seen corresponding path program 1 times [2024-10-13 11:00:29,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:29,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763159519] [2024-10-13 11:00:29,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:29,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:29,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763159519] [2024-10-13 11:00:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763159519] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904686657] [2024-10-13 11:00:29,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:29,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:29,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:29,755 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-10-13 11:00:29,757 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-10-13 11:00:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:29,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:00:29,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:29,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:29,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904686657] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:29,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:29,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-10-13 11:00:29,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183959838] [2024-10-13 11:00:29,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:29,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:00:29,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:29,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:00:29,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:00:29,893 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:29,930 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2024-10-13 11:00:29,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:00:29,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-13 11:00:29,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:29,931 INFO L225 Difference]: With dead ends: 51 [2024-10-13 11:00:29,931 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 11:00:29,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:00:29,932 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:29,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 96 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:00:29,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 11:00:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-13 11:00:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2024-10-13 11:00:29,935 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 19 [2024-10-13 11:00:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:29,935 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-10-13 11:00:29,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2024-10-13 11:00:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 11:00:29,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:29,936 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:29,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 11:00:30,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:30,137 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:30,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:30,138 INFO L85 PathProgramCache]: Analyzing trace with hash 642849539, now seen corresponding path program 1 times [2024-10-13 11:00:30,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:30,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786266540] [2024-10-13 11:00:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:30,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 11:00:30,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:30,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786266540] [2024-10-13 11:00:30,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786266540] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:30,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353952199] [2024-10-13 11:00:30,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:30,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:30,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:30,353 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-10-13 11:00:30,354 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-10-13 11:00:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:30,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 11:00:30,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:30,480 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-10-13 11:00:30,491 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 11:00:30,491 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-10-13 11:00:30,521 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 11:00:30,521 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-10-13 11:00:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:00:30,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:00:30,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353952199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:00:30,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:00:30,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2024-10-13 11:00:30,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471481026] [2024-10-13 11:00:30,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:00:30,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:00:30,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:30,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:00:30,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:00:30,543 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:30,610 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-10-13 11:00:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:00:30,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-13 11:00:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:30,611 INFO L225 Difference]: With dead ends: 67 [2024-10-13 11:00:30,611 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 11:00:30,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:00:30,612 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:30,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 43 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:00:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 11:00:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2024-10-13 11:00:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.542857142857143) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-10-13 11:00:30,616 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 20 [2024-10-13 11:00:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:30,616 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-10-13 11:00:30,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-10-13 11:00:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 11:00:30,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:30,617 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:30,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 11:00:30,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:30,818 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:30,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash 642849540, now seen corresponding path program 1 times [2024-10-13 11:00:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885926969] [2024-10-13 11:00:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:31,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885926969] [2024-10-13 11:00:31,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885926969] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083396819] [2024-10-13 11:00:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:31,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:31,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:31,115 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-10-13 11:00:31,131 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-10-13 11:00:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:31,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 11:00:31,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:31,258 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-10-13 11:00:31,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:31,276 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-10-13 11:00:31,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:31,328 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-10-13 11:00:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:00:31,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:00:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083396819] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:31,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:31,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 9 [2024-10-13 11:00:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75673327] [2024-10-13 11:00:31,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:31,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 11:00:31,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:31,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 11:00:31,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:00:31,634 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:31,786 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2024-10-13 11:00:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:00:31,787 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-13 11:00:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:31,787 INFO L225 Difference]: With dead ends: 61 [2024-10-13 11:00:31,787 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 11:00:31,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-13 11:00:31,788 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 162 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:31,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 54 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:00:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 11:00:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2024-10-13 11:00:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.4) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2024-10-13 11:00:31,797 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 20 [2024-10-13 11:00:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:31,797 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2024-10-13 11:00:31,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:31,798 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2024-10-13 11:00:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 11:00:31,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:31,798 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:31,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 11:00:31,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:31,999 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:31,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1546500741, now seen corresponding path program 1 times [2024-10-13 11:00:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:32,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494940661] [2024-10-13 11:00:32,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 11:00:32,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:32,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494940661] [2024-10-13 11:00:32,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494940661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:00:32,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:00:32,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:00:32,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022312150] [2024-10-13 11:00:32,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:00:32,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:00:32,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:32,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:00:32,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:00:32,144 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:32,277 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2024-10-13 11:00:32,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 11:00:32,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 11:00:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:32,278 INFO L225 Difference]: With dead ends: 60 [2024-10-13 11:00:32,278 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 11:00:32,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:00:32,279 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:32,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 79 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:00:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 11:00:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2024-10-13 11:00:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2024-10-13 11:00:32,282 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 21 [2024-10-13 11:00:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:32,282 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2024-10-13 11:00:32,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2024-10-13 11:00:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 11:00:32,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:32,283 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:32,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 11:00:32,284 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:32,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1546500740, now seen corresponding path program 1 times [2024-10-13 11:00:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:32,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676758622] [2024-10-13 11:00:32,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:32,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:00:32,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:32,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676758622] [2024-10-13 11:00:32,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676758622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:00:32,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:00:32,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:00:32,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103200105] [2024-10-13 11:00:32,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:00:32,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:00:32,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:32,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:00:32,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:00:32,503 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:32,638 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2024-10-13 11:00:32,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 11:00:32,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 11:00:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:32,639 INFO L225 Difference]: With dead ends: 61 [2024-10-13 11:00:32,639 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 11:00:32,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:00:32,640 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:32,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 111 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:00:32,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 11:00:32,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2024-10-13 11:00:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2024-10-13 11:00:32,645 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 21 [2024-10-13 11:00:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:32,645 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2024-10-13 11:00:32,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2024-10-13 11:00:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 11:00:32,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:32,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:32,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 11:00:32,647 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:32,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash -128467911, now seen corresponding path program 1 times [2024-10-13 11:00:32,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:32,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143950815] [2024-10-13 11:00:32,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:33,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:33,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143950815] [2024-10-13 11:00:33,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143950815] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:33,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356391514] [2024-10-13 11:00:33,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:33,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:33,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:33,223 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-10-13 11:00:33,225 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-10-13 11:00:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:33,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-13 11:00:33,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:33,478 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-10-13 11:00:33,539 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:00:33,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 11:00:33,578 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-10-13 11:00:33,609 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 19 treesize of output 18 [2024-10-13 11:00:33,666 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:00:33,666 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 41 treesize of output 38 [2024-10-13 11:00:33,862 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 48 treesize of output 28 [2024-10-13 11:00:33,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:33,906 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 32 treesize of output 16 [2024-10-13 11:00:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:33,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:34,002 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 28 treesize of output 20 [2024-10-13 11:00:34,008 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 24 treesize of output 16 [2024-10-13 11:00:34,073 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-10-13 11:00:34,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-10-13 11:00:34,079 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-10-13 11:00:34,089 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-10-13 11:00:34,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:34,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-10-13 11:00:34,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:34,107 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 46 treesize of output 28 [2024-10-13 11:00:34,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 11:00:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 11:00:34,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356391514] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:34,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:34,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2024-10-13 11:00:34,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360829192] [2024-10-13 11:00:34,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:34,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-13 11:00:34,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:34,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-13 11:00:34,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=830, Unknown=2, NotChecked=118, Total=1056 [2024-10-13 11:00:34,197 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 33 states, 32 states have (on average 2.0) internal successors, (64), 33 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:34,979 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-10-13 11:00:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 11:00:34,980 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.0) internal successors, (64), 33 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 11:00:34,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:34,980 INFO L225 Difference]: With dead ends: 71 [2024-10-13 11:00:34,980 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 11:00:34,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=280, Invalid=1532, Unknown=2, NotChecked=166, Total=1980 [2024-10-13 11:00:34,982 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 113 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:34,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 228 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 683 Invalid, 0 Unknown, 134 Unchecked, 0.4s Time] [2024-10-13 11:00:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 11:00:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2024-10-13 11:00:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-10-13 11:00:34,985 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 23 [2024-10-13 11:00:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:34,985 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-10-13 11:00:34,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.0) internal successors, (64), 33 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-10-13 11:00:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 11:00:34,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:34,986 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:35,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 11:00:35,186 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,SelfDestructingSolverStorable13 [2024-10-13 11:00:35,187 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:35,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:35,188 INFO L85 PathProgramCache]: Analyzing trace with hash -128467910, now seen corresponding path program 1 times [2024-10-13 11:00:35,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:35,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180315929] [2024-10-13 11:00:35,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:35,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:35,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180315929] [2024-10-13 11:00:35,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180315929] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:35,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695365543] [2024-10-13 11:00:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:35,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:35,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:35,790 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-10-13 11:00:35,792 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-10-13 11:00:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:36,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-13 11:00:36,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:36,029 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-10-13 11:00:36,121 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:00:36,121 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-10-13 11:00:36,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 13 treesize of output 9 [2024-10-13 11:00:36,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 11:00:36,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 11:00:36,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-13 11:00:36,290 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:00:36,291 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 62 treesize of output 57 [2024-10-13 11:00:36,297 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 39 treesize of output 20 [2024-10-13 11:00:36,491 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 83 treesize of output 59 [2024-10-13 11:00:36,494 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 63 treesize of output 43 [2024-10-13 11:00:36,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-13 11:00:36,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:36,551 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 19 treesize of output 7 [2024-10-13 11:00:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:36,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:36,708 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 64 treesize of output 48 [2024-10-13 11:00:36,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2024-10-13 11:00:36,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:36,797 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 48 treesize of output 52 [2024-10-13 11:00:36,832 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_917 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)))) (forall ((v_ArrVal_918 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_918) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2024-10-13 11:00:36,856 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 0))) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_917 (Array Int Int))) (< (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (forall ((v_ArrVal_916 Int) (v_ArrVal_918 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_916)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_918) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 8)))))) is different from false [2024-10-13 11:00:36,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:36,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-10-13 11:00:36,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-10-13 11:00:36,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 11:00:36,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:36,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2024-10-13 11:00:36,928 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:36,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:36,931 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 32 treesize of output 14 [2024-10-13 11:00:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 11:00:37,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695365543] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:37,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:37,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 36 [2024-10-13 11:00:37,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858521978] [2024-10-13 11:00:37,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:37,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-13 11:00:37,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:37,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-13 11:00:37,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1084, Unknown=2, NotChecked=134, Total=1332 [2024-10-13 11:00:37,070 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:38,097 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-10-13 11:00:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:00:38,098 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 11:00:38,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:38,098 INFO L225 Difference]: With dead ends: 74 [2024-10-13 11:00:38,098 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 11:00:38,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=349, Invalid=2207, Unknown=2, NotChecked=198, Total=2756 [2024-10-13 11:00:38,100 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 141 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:38,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 327 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 557 Invalid, 0 Unknown, 140 Unchecked, 0.3s Time] [2024-10-13 11:00:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 11:00:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2024-10-13 11:00:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.394736842105263) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-10-13 11:00:38,103 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 23 [2024-10-13 11:00:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:38,103 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-10-13 11:00:38,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-10-13 11:00:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 11:00:38,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:38,104 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:38,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 11:00:38,304 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,SelfDestructingSolverStorable14 [2024-10-13 11:00:38,305 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:38,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash 312467091, now seen corresponding path program 1 times [2024-10-13 11:00:38,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:38,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836019408] [2024-10-13 11:00:38,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:38,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:00:38,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:38,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836019408] [2024-10-13 11:00:38,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836019408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:00:38,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:00:38,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:00:38,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858478369] [2024-10-13 11:00:38,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:00:38,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:00:38,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:38,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:00:38,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:00:38,442 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:38,527 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2024-10-13 11:00:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 11:00:38,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-13 11:00:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:38,529 INFO L225 Difference]: With dead ends: 58 [2024-10-13 11:00:38,529 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 11:00:38,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:00:38,530 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:38,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 125 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:00:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 11:00:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2024-10-13 11:00:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.375) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2024-10-13 11:00:38,537 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 24 [2024-10-13 11:00:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:38,538 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-10-13 11:00:38,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2024-10-13 11:00:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 11:00:38,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:38,538 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:38,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 11:00:38,539 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:38,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:38,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1096545338, now seen corresponding path program 1 times [2024-10-13 11:00:38,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:38,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116835909] [2024-10-13 11:00:38,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:38,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:00:38,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:38,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116835909] [2024-10-13 11:00:38,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116835909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:00:38,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:00:38,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:00:38,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915671347] [2024-10-13 11:00:38,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:00:38,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:00:38,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:38,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:00:38,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:00:38,681 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:38,783 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2024-10-13 11:00:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 11:00:38,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-13 11:00:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:38,784 INFO L225 Difference]: With dead ends: 57 [2024-10-13 11:00:38,784 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 11:00:38,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:00:38,785 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:38,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 104 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:00:38,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 11:00:38,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2024-10-13 11:00:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2024-10-13 11:00:38,787 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 25 [2024-10-13 11:00:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:38,788 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-10-13 11:00:38,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2024-10-13 11:00:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:00:38,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:38,788 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:38,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 11:00:38,788 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:38,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:38,789 INFO L85 PathProgramCache]: Analyzing trace with hash -366832779, now seen corresponding path program 1 times [2024-10-13 11:00:38,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:38,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978633267] [2024-10-13 11:00:38,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:00:38,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:38,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978633267] [2024-10-13 11:00:38,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978633267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:00:38,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:00:38,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:00:38,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78091593] [2024-10-13 11:00:38,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:00:38,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:00:38,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:38,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:00:38,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:00:38,855 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:38,911 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-10-13 11:00:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:00:38,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 11:00:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:38,912 INFO L225 Difference]: With dead ends: 52 [2024-10-13 11:00:38,912 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 11:00:38,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:00:38,912 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:38,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 66 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:00:38,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 11:00:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 11:00:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2024-10-13 11:00:38,914 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 26 [2024-10-13 11:00:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:38,915 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-10-13 11:00:38,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2024-10-13 11:00:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 11:00:38,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:38,916 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:38,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 11:00:38,917 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:38,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1513085853, now seen corresponding path program 1 times [2024-10-13 11:00:38,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:38,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439635966] [2024-10-13 11:00:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:38,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:00:39,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:39,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439635966] [2024-10-13 11:00:39,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439635966] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:39,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331895357] [2024-10-13 11:00:39,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:39,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:39,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:39,098 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-10-13 11:00:39,100 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-10-13 11:00:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:39,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:00:39,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:39,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:39,300 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-10-13 11:00:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:00:39,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:00:39,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331895357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:00:39,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:00:39,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-13 11:00:39,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409400423] [2024-10-13 11:00:39,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:00:39,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:00:39,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:39,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:00:39,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-13 11:00:39,303 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:39,371 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-10-13 11:00:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:00:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-13 11:00:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:39,372 INFO L225 Difference]: With dead ends: 51 [2024-10-13 11:00:39,372 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 11:00:39,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-13 11:00:39,373 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:39,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 55 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:00:39,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 11:00:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-13 11:00:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-10-13 11:00:39,375 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 27 [2024-10-13 11:00:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:39,375 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-10-13 11:00:39,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-10-13 11:00:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:00:39,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:39,376 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:39,408 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-10-13 11:00:39,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:39,577 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:39,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1918372248, now seen corresponding path program 1 times [2024-10-13 11:00:39,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:39,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875145641] [2024-10-13 11:00:39,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:39,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:00:39,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875145641] [2024-10-13 11:00:39,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875145641] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743714992] [2024-10-13 11:00:39,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:39,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:39,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:39,644 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-10-13 11:00:39,645 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-10-13 11:00:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:39,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:00:39,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:00:39,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:00:39,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743714992] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:39,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:39,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-13 11:00:39,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828296074] [2024-10-13 11:00:39,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:39,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:00:39,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:39,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:00:39,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:00:39,864 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:39,888 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2024-10-13 11:00:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:00:39,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-13 11:00:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:39,889 INFO L225 Difference]: With dead ends: 54 [2024-10-13 11:00:39,889 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 11:00:39,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:00:39,890 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:39,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 123 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:00:39,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 11:00:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 11:00:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2024-10-13 11:00:39,891 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 29 [2024-10-13 11:00:39,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:39,892 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2024-10-13 11:00:39,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2024-10-13 11:00:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:00:39,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:39,894 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-10-13 11:00:39,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-13 11:00:40,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:40,095 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:40,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:40,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1918372221, now seen corresponding path program 1 times [2024-10-13 11:00:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:40,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276463527] [2024-10-13 11:00:40,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:00:40,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:40,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276463527] [2024-10-13 11:00:40,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276463527] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:40,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202492818] [2024-10-13 11:00:40,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:40,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:40,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:40,182 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-10-13 11:00:40,183 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-10-13 11:00:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:40,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 11:00:40,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:00:40,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:40,361 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 11:00:40,361 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 12 treesize of output 11 [2024-10-13 11:00:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 11:00:40,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202492818] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:40,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:40,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-10-13 11:00:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116050204] [2024-10-13 11:00:40,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:40,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:00:40,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:40,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:00:40,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:00:40,373 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:40,412 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-10-13 11:00:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:00:40,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-13 11:00:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:40,413 INFO L225 Difference]: With dead ends: 52 [2024-10-13 11:00:40,413 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 11:00:40,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:00:40,413 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:40,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 34 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:00:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 11:00:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 11:00:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.25) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2024-10-13 11:00:40,415 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 29 [2024-10-13 11:00:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:40,415 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-10-13 11:00:40,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2024-10-13 11:00:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 11:00:40,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:40,416 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] [2024-10-13 11:00:40,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-13 11:00:40,621 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,SelfDestructingSolverStorable20 [2024-10-13 11:00:40,622 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:40,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash 660003323, now seen corresponding path program 1 times [2024-10-13 11:00:40,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:40,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534814822] [2024-10-13 11:00:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:40,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:41,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:41,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534814822] [2024-10-13 11:00:41,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534814822] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:41,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670494335] [2024-10-13 11:00:41,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:41,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:41,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:41,676 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-10-13 11:00:41,679 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-10-13 11:00:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:41,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-13 11:00:41,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:41,873 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-10-13 11:00:41,965 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:00:41,966 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-10-13 11:00:42,012 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-10-13 11:00:42,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 11:00:42,092 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:00:42,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-10-13 11:00:42,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-10-13 11:00:42,318 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:42,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:42,321 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 30 treesize of output 15 [2024-10-13 11:00:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:42,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:42,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-13 11:00:42,553 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-10-13 11:00:42,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:42,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 28 [2024-10-13 11:00:42,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-10-13 11:00:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670494335] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:43,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:43,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 16] total 48 [2024-10-13 11:00:43,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473088248] [2024-10-13 11:00:43,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:43,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-13 11:00:43,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:43,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-13 11:00:43,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2093, Unknown=4, NotChecked=0, Total=2256 [2024-10-13 11:00:43,069 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 48 states, 48 states have (on average 1.75) internal successors, (84), 48 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:44,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:44,162 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2024-10-13 11:00:44,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 11:00:44,162 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.75) internal successors, (84), 48 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-13 11:00:44,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:44,163 INFO L225 Difference]: With dead ends: 65 [2024-10-13 11:00:44,163 INFO L226 Difference]: Without dead ends: 65 [2024-10-13 11:00:44,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=423, Invalid=3863, Unknown=4, NotChecked=0, Total=4290 [2024-10-13 11:00:44,165 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 113 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:44,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 402 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1025 Invalid, 3 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:00:44,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-13 11:00:44,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2024-10-13 11:00:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 51 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2024-10-13 11:00:44,167 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 30 [2024-10-13 11:00:44,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:44,168 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2024-10-13 11:00:44,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.75) internal successors, (84), 48 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2024-10-13 11:00:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:00:44,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:44,168 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] [2024-10-13 11:00:44,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-13 11:00:44,368 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,SelfDestructingSolverStorable21 [2024-10-13 11:00:44,369 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:44,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:44,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1975835843, now seen corresponding path program 1 times [2024-10-13 11:00:44,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:44,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251923163] [2024-10-13 11:00:44,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:44,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:45,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:45,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251923163] [2024-10-13 11:00:45,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251923163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:45,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389733287] [2024-10-13 11:00:45,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:45,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:45,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:45,096 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-10-13 11:00:45,098 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-10-13 11:00:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:45,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-13 11:00:45,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:45,297 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-10-13 11:00:45,316 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:00:45,316 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-10-13 11:00:45,328 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-10-13 11:00:45,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 11:00:45,368 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:00:45,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 11:00:45,548 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-10-13 11:00:45,549 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 47 treesize of output 29 [2024-10-13 11:00:45,676 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-10-13 11:00:45,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:45,788 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-10-13 11:00:45,818 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-10-13 11:00:45,825 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-10-13 11:00:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:45,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:46,030 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-10-13 11:00:46,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2024-10-13 11:00:46,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:46,117 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 31 treesize of output 35 [2024-10-13 11:00:46,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-10-13 11:00:46,216 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 102 treesize of output 98 [2024-10-13 11:00:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:46,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389733287] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:46,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:46,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 37 [2024-10-13 11:00:46,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385745712] [2024-10-13 11:00:46,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:46,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-13 11:00:46,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:46,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-13 11:00:46,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2024-10-13 11:00:46,296 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:47,183 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-10-13 11:00:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 11:00:47,183 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-13 11:00:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:47,183 INFO L225 Difference]: With dead ends: 77 [2024-10-13 11:00:47,183 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 11:00:47,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=304, Invalid=2558, Unknown=0, NotChecked=0, Total=2862 [2024-10-13 11:00:47,185 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 71 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:47,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 313 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:00:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 11:00:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2024-10-13 11:00:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2024-10-13 11:00:47,187 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 31 [2024-10-13 11:00:47,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:47,187 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2024-10-13 11:00:47,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2024-10-13 11:00:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:00:47,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:47,188 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] [2024-10-13 11:00:47,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-13 11:00:47,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:47,389 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:47,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:47,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1975835844, now seen corresponding path program 1 times [2024-10-13 11:00:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327883358] [2024-10-13 11:00:47,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:47,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:48,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:48,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327883358] [2024-10-13 11:00:48,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327883358] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:48,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780369687] [2024-10-13 11:00:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:48,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:48,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:48,162 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-10-13 11:00:48,163 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-10-13 11:00:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:48,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-13 11:00:48,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:48,378 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-10-13 11:00:48,382 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-10-13 11:00:48,470 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 11:00:48,470 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-10-13 11:00:48,482 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:00:48,483 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-10-13 11:00:48,533 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-10-13 11:00:48,538 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-10-13 11:00:48,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 11:00:48,581 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 19 treesize of output 18 [2024-10-13 11:00:48,632 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:00:48,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 11:00:48,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-10-13 11:00:48,841 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-10-13 11:00:48,842 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 47 treesize of output 29 [2024-10-13 11:00:48,852 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:48,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:48,860 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 2 case distinctions, treesize of input 40 treesize of output 34 [2024-10-13 11:00:49,134 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-10-13 11:00:49,138 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-10-13 11:00:49,208 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-10-13 11:00:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:49,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:49,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:49,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 133 [2024-10-13 11:00:49,721 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 46 treesize of output 30 [2024-10-13 11:00:49,842 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1760 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))) (forall ((v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1759) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))) is different from false [2024-10-13 11:00:49,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1757 Int) (v_ArrVal_1759 (Array Int Int))) (<= (+ 8 (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1757)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1759) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (forall ((v_ArrVal_1760 (Array Int Int))) (<= 0 (+ 4 (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))))) is different from false [2024-10-13 11:00:49,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:49,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-10-13 11:00:49,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:49,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2024-10-13 11:00:49,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:49,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 2 case distinctions, treesize of input 51 treesize of output 57 [2024-10-13 11:00:49,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:49,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2024-10-13 11:00:49,932 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:49,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:49,940 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 29 treesize of output 27 [2024-10-13 11:00:49,943 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:49,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:49,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-10-13 11:00:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 11:00:50,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780369687] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:00:50,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:00:50,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 50 [2024-10-13 11:00:50,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021568585] [2024-10-13 11:00:50,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:50,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-13 11:00:50,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:50,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-13 11:00:50,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2183, Unknown=2, NotChecked=190, Total=2550 [2024-10-13 11:00:50,320 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 51 states, 50 states have (on average 1.82) internal successors, (91), 51 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:51,389 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-10-13 11:00:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 11:00:51,390 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.82) internal successors, (91), 51 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-13 11:00:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:51,390 INFO L225 Difference]: With dead ends: 71 [2024-10-13 11:00:51,390 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 11:00:51,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=432, Invalid=3606, Unknown=2, NotChecked=250, Total=4290 [2024-10-13 11:00:51,391 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 118 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:51,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 407 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 907 Invalid, 0 Unknown, 112 Unchecked, 0.5s Time] [2024-10-13 11:00:51,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 11:00:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2024-10-13 11:00:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2024-10-13 11:00:51,393 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2024-10-13 11:00:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:51,393 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2024-10-13 11:00:51,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.82) internal successors, (91), 51 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:00:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2024-10-13 11:00:51,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:00:51,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:51,394 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:51,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-13 11:00:51,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:51,595 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 11:00:51,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:51,595 INFO L85 PathProgramCache]: Analyzing trace with hash 402760065, now seen corresponding path program 1 times [2024-10-13 11:00:51,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:51,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639151081] [2024-10-13 11:00:51,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:51,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:53,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:53,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639151081] [2024-10-13 11:00:53,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639151081] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:53,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004235277] [2024-10-13 11:00:53,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:53,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:53,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:53,077 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-10-13 11:00:53,087 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-10-13 11:00:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:53,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-10-13 11:00:53,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:53,286 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-10-13 11:00:53,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:00:53,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:00:53,317 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-10-13 11:00:53,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-13 11:00:53,395 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:00:53,396 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-10-13 11:00:53,446 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-10-13 11:00:53,452 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 16 [2024-10-13 11:00:53,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-13 11:00:53,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-13 11:00:53,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-13 11:00:53,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-10-13 11:00:53,605 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 11:00:53,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 65 [2024-10-13 11:00:53,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 38 [2024-10-13 11:00:53,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:53,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:54,023 INFO L349 Elim1Store]: treesize reduction 168, result has 41.1 percent of original size [2024-10-13 11:00:54,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 129 [2024-10-13 11:00:54,057 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:00:54,114 INFO L349 Elim1Store]: treesize reduction 122, result has 39.6 percent of original size [2024-10-13 11:00:54,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 123 [2024-10-13 11:00:54,722 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-10-13 11:00:54,727 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 103 treesize of output 67 [2024-10-13 11:00:54,901 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 19 treesize of output 11 [2024-10-13 11:00:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:00:54,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:55,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:55,418 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 322 treesize of output 321 [2024-10-13 11:01:12,258 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 60 treesize of output 40