./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:04:09,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:04:09,175 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:04:09,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:04:09,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:04:09,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:04:09,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:04:09,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:04:09,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:04:09,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:04:09,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:04:09,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:04:09,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:04:09,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:04:09,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:04:09,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:04:09,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:04:09,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:04:09,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:04:09,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:04:09,210 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:04:09,211 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:04:09,211 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:04:09,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:04:09,211 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:04:09,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:04:09,212 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:04:09,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:04:09,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:04:09,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:04:09,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:04:09,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:04:09,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:04:09,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:04:09,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:04:09,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:04:09,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:04:09,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:04:09,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:04:09,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:04:09,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:04:09,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:04:09,215 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-11-19 09:04:09,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:04:09,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:04:09,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:04:09,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:04:09,420 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:04:09,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i [2024-11-19 09:04:10,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:04:10,862 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:04:10,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i [2024-11-19 09:04:10,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab4530ec/a07baf4c2b904166b59832a08ea75a26/FLAGd42177332 [2024-11-19 09:04:11,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab4530ec/a07baf4c2b904166b59832a08ea75a26 [2024-11-19 09:04:11,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:04:11,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:04:11,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:04:11,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:04:11,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:04:11,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:11,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d92e270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11, skipping insertion in model container [2024-11-19 09:04:11,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:11,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:04:11,561 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:11,594 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:11,599 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:11,602 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:11,608 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:11,639 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:11,641 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:11,643 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:11,647 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:11,653 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:11,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:04:11,669 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:04:11,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:04:11,795 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:04:11,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11 WrapperNode [2024-11-19 09:04:11,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:04:11,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:04:11,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:04:11,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:04:11,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:11,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:11,877 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1563 [2024-11-19 09:04:11,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:04:11,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:04:11,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:04:11,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:04:11,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:11,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:11,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:12,027 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-19 09:04:12,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:12,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:12,070 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:12,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:12,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:12,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:12,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:04:12,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:04:12,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:04:12,106 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:04:12,107 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11" (1/1) ... [2024-11-19 09:04:12,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:04:12,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:04:12,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:04:12,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:04:12,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:04:12,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:04:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:04:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:04:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 09:04:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 09:04:12,177 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 09:04:12,177 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 09:04:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:04:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:04:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:04:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:04:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:04:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:04:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:04:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:04:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:04:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:04:12,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:04:12,378 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:04:12,381 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:04:12,383 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:04:12,415 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:04:14,121 INFO L? ?]: Removed 1493 outVars from TransFormulas that were not future-live. [2024-11-19 09:04:14,121 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:04:14,145 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:04:14,146 INFO L316 CfgBuilder]: Removed 60 assume(true) statements. [2024-11-19 09:04:14,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:04:14 BoogieIcfgContainer [2024-11-19 09:04:14,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:04:14,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:04:14,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:04:14,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:04:14,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:04:11" (1/3) ... [2024-11-19 09:04:14,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5956c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:04:14, skipping insertion in model container [2024-11-19 09:04:14,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:11" (2/3) ... [2024-11-19 09:04:14,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5956c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:04:14, skipping insertion in model container [2024-11-19 09:04:14,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:04:14" (3/3) ... [2024-11-19 09:04:14,155 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test4-1.i [2024-11-19 09:04:14,167 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:04:14,167 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-19 09:04:14,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:04:14,218 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;@146ad3a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:04:14,218 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-19 09:04:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 1432 states, 802 states have (on average 2.0773067331670823) internal successors, (1666), 1424 states have internal predecessors, (1666), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 09:04:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 09:04:14,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:14,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 09:04:14,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr627ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:14,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:14,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1482245, now seen corresponding path program 1 times [2024-11-19 09:04:14,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:14,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181825168] [2024-11-19 09:04:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:14,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:14,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:14,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181825168] [2024-11-19 09:04:14,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181825168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:14,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:14,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:04:14,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567017739] [2024-11-19 09:04:14,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:14,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:14,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:14,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:14,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:14,389 INFO L87 Difference]: Start difference. First operand has 1432 states, 802 states have (on average 2.0773067331670823) internal successors, (1666), 1424 states have internal predecessors, (1666), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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-11-19 09:04:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:15,063 INFO L93 Difference]: Finished difference Result 1437 states and 1617 transitions. [2024-11-19 09:04:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:15,065 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-11-19 09:04:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:15,083 INFO L225 Difference]: With dead ends: 1437 [2024-11-19 09:04:15,083 INFO L226 Difference]: Without dead ends: 1433 [2024-11-19 09:04:15,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:15,087 INFO L432 NwaCegarLoop]: 1582 mSDtfsCounter, 26 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2550 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:15,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2550 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 09:04:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2024-11-19 09:04:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1424. [2024-11-19 09:04:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 805 states have (on average 1.9838509316770185) internal successors, (1597), 1416 states have internal predecessors, (1597), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 09:04:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1609 transitions. [2024-11-19 09:04:15,160 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1609 transitions. Word has length 4 [2024-11-19 09:04:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:15,160 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 1609 transitions. [2024-11-19 09:04:15,160 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-11-19 09:04:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1609 transitions. [2024-11-19 09:04:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 09:04:15,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:15,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:04:15,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:04:15,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:15,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:15,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1422076526, now seen corresponding path program 1 times [2024-11-19 09:04:15,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:15,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823043506] [2024-11-19 09:04:15,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:15,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:15,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:15,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823043506] [2024-11-19 09:04:15,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823043506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:15,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:15,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:04:15,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661570106] [2024-11-19 09:04:15,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:15,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:15,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:15,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:15,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:15,257 INFO L87 Difference]: Start difference. First operand 1424 states and 1609 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:15,913 INFO L93 Difference]: Finished difference Result 1330 states and 1513 transitions. [2024-11-19 09:04:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 09:04:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:15,917 INFO L225 Difference]: With dead ends: 1330 [2024-11-19 09:04:15,917 INFO L226 Difference]: Without dead ends: 1330 [2024-11-19 09:04:15,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:15,918 INFO L432 NwaCegarLoop]: 882 mSDtfsCounter, 1353 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:15,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 889 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 09:04:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2024-11-19 09:04:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2024-11-19 09:04:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 805 states have (on average 1.8645962732919255) internal successors, (1501), 1322 states have internal predecessors, (1501), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 09:04:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1513 transitions. [2024-11-19 09:04:15,937 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1513 transitions. Word has length 6 [2024-11-19 09:04:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:15,938 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1513 transitions. [2024-11-19 09:04:15,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1513 transitions. [2024-11-19 09:04:15,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 09:04:15,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:15,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:04:15,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:04:15,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:15,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:15,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1422076527, now seen corresponding path program 1 times [2024-11-19 09:04:15,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:15,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526656706] [2024-11-19 09:04:15,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:15,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:16,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526656706] [2024-11-19 09:04:16,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526656706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:16,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:16,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:04:16,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460549785] [2024-11-19 09:04:16,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:16,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:16,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:16,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:16,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:16,047 INFO L87 Difference]: Start difference. First operand 1330 states and 1513 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:16,775 INFO L93 Difference]: Finished difference Result 1746 states and 2007 transitions. [2024-11-19 09:04:16,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:16,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 09:04:16,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:16,781 INFO L225 Difference]: With dead ends: 1746 [2024-11-19 09:04:16,781 INFO L226 Difference]: Without dead ends: 1746 [2024-11-19 09:04:16,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:16,784 INFO L432 NwaCegarLoop]: 1248 mSDtfsCounter, 820 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:16,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1871 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 09:04:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2024-11-19 09:04:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1593. [2024-11-19 09:04:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1078 states have (on average 1.8320964749536177) internal successors, (1975), 1585 states have internal predecessors, (1975), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 09:04:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 1987 transitions. [2024-11-19 09:04:16,811 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 1987 transitions. Word has length 6 [2024-11-19 09:04:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:16,811 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 1987 transitions. [2024-11-19 09:04:16,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1987 transitions. [2024-11-19 09:04:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 09:04:16,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:16,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:16,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:04:16,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:16,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1137087712, now seen corresponding path program 1 times [2024-11-19 09:04:16,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:16,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488078870] [2024-11-19 09:04:16,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:16,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:16,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:16,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488078870] [2024-11-19 09:04:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488078870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:16,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:16,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:16,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206404620] [2024-11-19 09:04:16,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:16,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:16,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:16,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:16,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:16,880 INFO L87 Difference]: Start difference. First operand 1593 states and 1987 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:17,178 INFO L93 Difference]: Finished difference Result 2646 states and 3337 transitions. [2024-11-19 09:04:17,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:17,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-19 09:04:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:17,186 INFO L225 Difference]: With dead ends: 2646 [2024-11-19 09:04:17,186 INFO L226 Difference]: Without dead ends: 2644 [2024-11-19 09:04:17,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:17,187 INFO L432 NwaCegarLoop]: 1481 mSDtfsCounter, 997 mSDsluCounter, 2727 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 4208 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:17,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 4208 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 09:04:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2024-11-19 09:04:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2345. [2024-11-19 09:04:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 1830 states have (on average 1.812568306010929) internal successors, (3317), 2334 states have internal predecessors, (3317), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:04:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3335 transitions. [2024-11-19 09:04:17,229 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3335 transitions. Word has length 7 [2024-11-19 09:04:17,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:17,229 INFO L471 AbstractCegarLoop]: Abstraction has 2345 states and 3335 transitions. [2024-11-19 09:04:17,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:17,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3335 transitions. [2024-11-19 09:04:17,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 09:04:17,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:17,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:17,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:04:17,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:17,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:17,230 INFO L85 PathProgramCache]: Analyzing trace with hash 242137368, now seen corresponding path program 1 times [2024-11-19 09:04:17,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:17,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251944042] [2024-11-19 09:04:17,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:17,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:17,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251944042] [2024-11-19 09:04:17,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251944042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:17,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:17,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:17,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805734209] [2024-11-19 09:04:17,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:17,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:17,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:17,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:17,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:17,288 INFO L87 Difference]: Start difference. First operand 2345 states and 3335 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-11-19 09:04:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:18,050 INFO L93 Difference]: Finished difference Result 2420 states and 3441 transitions. [2024-11-19 09:04:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:18,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 12 [2024-11-19 09:04:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:18,057 INFO L225 Difference]: With dead ends: 2420 [2024-11-19 09:04:18,057 INFO L226 Difference]: Without dead ends: 2420 [2024-11-19 09:04:18,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:18,058 INFO L432 NwaCegarLoop]: 856 mSDtfsCounter, 1621 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:18,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 1572 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 09:04:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2024-11-19 09:04:18,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2322. [2024-11-19 09:04:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 1830 states have (on average 1.787431693989071) internal successors, (3271), 2311 states have internal predecessors, (3271), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:04:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3289 transitions. [2024-11-19 09:04:18,098 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3289 transitions. Word has length 12 [2024-11-19 09:04:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:18,098 INFO L471 AbstractCegarLoop]: Abstraction has 2322 states and 3289 transitions. [2024-11-19 09:04:18,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-11-19 09:04:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3289 transitions. [2024-11-19 09:04:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 09:04:18,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:18,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:18,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:04:18,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:18,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:18,102 INFO L85 PathProgramCache]: Analyzing trace with hash 242137369, now seen corresponding path program 1 times [2024-11-19 09:04:18,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:18,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753665299] [2024-11-19 09:04:18,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:18,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:18,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:18,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753665299] [2024-11-19 09:04:18,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753665299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:18,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:18,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:18,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651254650] [2024-11-19 09:04:18,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:18,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:18,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:18,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:18,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:18,160 INFO L87 Difference]: Start difference. First operand 2322 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 4.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-11-19 09:04:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:18,181 INFO L93 Difference]: Finished difference Result 2184 states and 3083 transitions. [2024-11-19 09:04:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:18,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.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 12 [2024-11-19 09:04:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:18,187 INFO L225 Difference]: With dead ends: 2184 [2024-11-19 09:04:18,187 INFO L226 Difference]: Without dead ends: 2184 [2024-11-19 09:04:18,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:18,189 INFO L432 NwaCegarLoop]: 1345 mSDtfsCounter, 61 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:18,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2637 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:18,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2024-11-19 09:04:18,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2184. [2024-11-19 09:04:18,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1704 states have (on average 1.7987089201877935) internal successors, (3065), 2173 states have internal predecessors, (3065), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:04:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3083 transitions. [2024-11-19 09:04:18,216 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3083 transitions. Word has length 12 [2024-11-19 09:04:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:18,216 INFO L471 AbstractCegarLoop]: Abstraction has 2184 states and 3083 transitions. [2024-11-19 09:04:18,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.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-11-19 09:04:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3083 transitions. [2024-11-19 09:04:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 09:04:18,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:18,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:18,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:04:18,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:18,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:18,218 INFO L85 PathProgramCache]: Analyzing trace with hash 765933813, now seen corresponding path program 1 times [2024-11-19 09:04:18,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:18,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55359103] [2024-11-19 09:04:18,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:18,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:18,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:18,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55359103] [2024-11-19 09:04:18,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55359103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:18,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:18,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:18,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758930675] [2024-11-19 09:04:18,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:18,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:18,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:18,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:18,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:18,273 INFO L87 Difference]: Start difference. First operand 2184 states and 3083 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-11-19 09:04:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:18,323 INFO L93 Difference]: Finished difference Result 2155 states and 3033 transitions. [2024-11-19 09:04:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:18,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 14 [2024-11-19 09:04:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:18,328 INFO L225 Difference]: With dead ends: 2155 [2024-11-19 09:04:18,329 INFO L226 Difference]: Without dead ends: 2155 [2024-11-19 09:04:18,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:18,331 INFO L432 NwaCegarLoop]: 1310 mSDtfsCounter, 41 mSDsluCounter, 2592 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3902 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:18,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3902 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2024-11-19 09:04:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2149. [2024-11-19 09:04:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 1676 states have (on average 1.795346062052506) internal successors, (3009), 2138 states have internal predecessors, (3009), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:04:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3027 transitions. [2024-11-19 09:04:18,360 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3027 transitions. Word has length 14 [2024-11-19 09:04:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:18,360 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3027 transitions. [2024-11-19 09:04:18,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-11-19 09:04:18,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3027 transitions. [2024-11-19 09:04:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 09:04:18,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:18,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:18,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:04:18,361 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:18,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1739624061, now seen corresponding path program 1 times [2024-11-19 09:04:18,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:18,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548062031] [2024-11-19 09:04:18,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548062031] [2024-11-19 09:04:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548062031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815498822] [2024-11-19 09:04:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:18,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:18,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:18,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:18,501 INFO L87 Difference]: Start difference. First operand 2149 states and 3027 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:19,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:19,383 INFO L93 Difference]: Finished difference Result 2398 states and 3195 transitions. [2024-11-19 09:04:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:19,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 09:04:19,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:19,389 INFO L225 Difference]: With dead ends: 2398 [2024-11-19 09:04:19,389 INFO L226 Difference]: Without dead ends: 2398 [2024-11-19 09:04:19,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:19,390 INFO L432 NwaCegarLoop]: 1223 mSDtfsCounter, 825 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:19,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2627 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 09:04:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2024-11-19 09:04:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2145. [2024-11-19 09:04:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 1676 states have (on average 1.7905727923627686) internal successors, (3001), 2134 states have internal predecessors, (3001), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:04:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3019 transitions. [2024-11-19 09:04:19,412 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3019 transitions. Word has length 28 [2024-11-19 09:04:19,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:19,413 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 3019 transitions. [2024-11-19 09:04:19,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3019 transitions. [2024-11-19 09:04:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 09:04:19,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:19,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:19,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:04:19,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:19,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:19,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2099910807, now seen corresponding path program 1 times [2024-11-19 09:04:19,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:19,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071695011] [2024-11-19 09:04:19,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:19,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:19,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071695011] [2024-11-19 09:04:19,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071695011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:19,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204353305] [2024-11-19 09:04:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:19,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:19,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:19,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:19,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:19,491 INFO L87 Difference]: Start difference. First operand 2145 states and 3019 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:19,534 INFO L93 Difference]: Finished difference Result 2145 states and 3011 transitions. [2024-11-19 09:04:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:04:19,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2024-11-19 09:04:19,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:19,539 INFO L225 Difference]: With dead ends: 2145 [2024-11-19 09:04:19,539 INFO L226 Difference]: Without dead ends: 2145 [2024-11-19 09:04:19,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:19,541 INFO L432 NwaCegarLoop]: 1305 mSDtfsCounter, 21 mSDsluCounter, 2579 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:19,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3884 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:19,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2024-11-19 09:04:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2145. [2024-11-19 09:04:19,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 1676 states have (on average 1.785799522673031) internal successors, (2993), 2134 states have internal predecessors, (2993), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:04:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3011 transitions. [2024-11-19 09:04:19,564 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3011 transitions. Word has length 62 [2024-11-19 09:04:19,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:19,569 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 3011 transitions. [2024-11-19 09:04:19,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3011 transitions. [2024-11-19 09:04:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-19 09:04:19,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:19,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:19,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:04:19,571 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:19,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:19,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1896484451, now seen corresponding path program 1 times [2024-11-19 09:04:19,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:19,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446922676] [2024-11-19 09:04:19,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:19,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:19,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:19,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446922676] [2024-11-19 09:04:19,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446922676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:19,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:19,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:19,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488951964] [2024-11-19 09:04:19,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:19,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:19,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:19,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:19,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:19,650 INFO L87 Difference]: Start difference. First operand 2145 states and 3011 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:19,699 INFO L93 Difference]: Finished difference Result 1914 states and 2608 transitions. [2024-11-19 09:04:19,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:19,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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 70 [2024-11-19 09:04:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:19,703 INFO L225 Difference]: With dead ends: 1914 [2024-11-19 09:04:19,704 INFO L226 Difference]: Without dead ends: 1914 [2024-11-19 09:04:19,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:19,704 INFO L432 NwaCegarLoop]: 1320 mSDtfsCounter, 54 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:19,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2612 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2024-11-19 09:04:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1914. [2024-11-19 09:04:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1445 states have (on average 1.792387543252595) internal successors, (2590), 1903 states have internal predecessors, (2590), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:04:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2608 transitions. [2024-11-19 09:04:19,721 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2608 transitions. Word has length 70 [2024-11-19 09:04:19,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:19,722 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2608 transitions. [2024-11-19 09:04:19,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2608 transitions. [2024-11-19 09:04:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-19 09:04:19,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:19,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:19,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:04:19,726 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:19,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:19,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2061322021, now seen corresponding path program 1 times [2024-11-19 09:04:19,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:19,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001339327] [2024-11-19 09:04:19,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:19,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:20,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:20,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:20,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001339327] [2024-11-19 09:04:20,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001339327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:20,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:20,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:04:20,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998627657] [2024-11-19 09:04:20,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:20,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:04:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:20,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:04:20,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:04:20,058 INFO L87 Difference]: Start difference. First operand 1914 states and 2608 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:21,117 INFO L93 Difference]: Finished difference Result 1830 states and 2483 transitions. [2024-11-19 09:04:21,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:04:21,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-19 09:04:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:21,121 INFO L225 Difference]: With dead ends: 1830 [2024-11-19 09:04:21,122 INFO L226 Difference]: Without dead ends: 1830 [2024-11-19 09:04:21,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:04:21,122 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 2256 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2262 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:21,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2262 Valid, 1594 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 09:04:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2024-11-19 09:04:21,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1557. [2024-11-19 09:04:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1172 states have (on average 1.6902730375426622) internal successors, (1981), 1546 states have internal predecessors, (1981), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:04:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1999 transitions. [2024-11-19 09:04:21,139 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1999 transitions. Word has length 73 [2024-11-19 09:04:21,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:21,139 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 1999 transitions. [2024-11-19 09:04:21,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1999 transitions. [2024-11-19 09:04:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 09:04:21,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:21,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:21,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:04:21,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:21,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:21,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1316131126, now seen corresponding path program 1 times [2024-11-19 09:04:21,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:21,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87793882] [2024-11-19 09:04:21,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:21,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:21,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:21,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87793882] [2024-11-19 09:04:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87793882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:21,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:21,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:21,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902038722] [2024-11-19 09:04:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:21,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:04:21,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:21,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:04:21,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:21,335 INFO L87 Difference]: Start difference. First operand 1557 states and 1999 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:21,955 INFO L93 Difference]: Finished difference Result 1556 states and 1997 transitions. [2024-11-19 09:04:21,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:04:21,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-19 09:04:21,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:21,961 INFO L225 Difference]: With dead ends: 1556 [2024-11-19 09:04:21,962 INFO L226 Difference]: Without dead ends: 1556 [2024-11-19 09:04:21,962 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-11-19 09:04:21,963 INFO L432 NwaCegarLoop]: 1232 mSDtfsCounter, 2 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:21,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3468 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 09:04:21,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2024-11-19 09:04:21,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2024-11-19 09:04:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1172 states have (on average 1.6885665529010239) internal successors, (1979), 1545 states have internal predecessors, (1979), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:04:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1997 transitions. [2024-11-19 09:04:21,979 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1997 transitions. Word has length 78 [2024-11-19 09:04:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:21,979 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 1997 transitions. [2024-11-19 09:04:21,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1997 transitions. [2024-11-19 09:04:21,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 09:04:21,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:21,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:21,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:04:21,980 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:21,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:21,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1316131127, now seen corresponding path program 1 times [2024-11-19 09:04:21,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:21,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557198145] [2024-11-19 09:04:21,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:21,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:22,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557198145] [2024-11-19 09:04:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557198145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:22,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:22,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686055803] [2024-11-19 09:04:22,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:22,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:04:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:22,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:04:22,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:22,325 INFO L87 Difference]: Start difference. First operand 1556 states and 1997 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:23,051 INFO L93 Difference]: Finished difference Result 1555 states and 1995 transitions. [2024-11-19 09:04:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:04:23,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-19 09:04:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:23,055 INFO L225 Difference]: With dead ends: 1555 [2024-11-19 09:04:23,055 INFO L226 Difference]: Without dead ends: 1555 [2024-11-19 09:04:23,055 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-11-19 09:04:23,055 INFO L432 NwaCegarLoop]: 1232 mSDtfsCounter, 1 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:23,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3483 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 09:04:23,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2024-11-19 09:04:23,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1555. [2024-11-19 09:04:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1170 states have (on average 1.6897435897435897) internal successors, (1977), 1544 states have internal predecessors, (1977), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:04:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1995 transitions. [2024-11-19 09:04:23,071 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1995 transitions. Word has length 78 [2024-11-19 09:04:23,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:23,071 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 1995 transitions. [2024-11-19 09:04:23,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1995 transitions. [2024-11-19 09:04:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 09:04:23,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:23,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:23,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:04:23,072 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:23,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1591552707, now seen corresponding path program 1 times [2024-11-19 09:04:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:23,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345970688] [2024-11-19 09:04:23,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:23,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:23,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345970688] [2024-11-19 09:04:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345970688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:23,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:23,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:04:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616955729] [2024-11-19 09:04:23,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:23,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:04:23,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:04:23,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:04:23,256 INFO L87 Difference]: Start difference. First operand 1555 states and 1995 transitions. Second operand has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:24,190 INFO L93 Difference]: Finished difference Result 1573 states and 2025 transitions. [2024-11-19 09:04:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:04:24,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-11-19 09:04:24,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:24,195 INFO L225 Difference]: With dead ends: 1573 [2024-11-19 09:04:24,195 INFO L226 Difference]: Without dead ends: 1573 [2024-11-19 09:04:24,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:04:24,196 INFO L432 NwaCegarLoop]: 1221 mSDtfsCounter, 6 mSDsluCounter, 4248 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5469 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:24,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5469 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 09:04:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2024-11-19 09:04:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1564. [2024-11-19 09:04:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1178 states have (on average 1.6876061120543293) internal successors, (1988), 1551 states have internal predecessors, (1988), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-19 09:04:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2015 transitions. [2024-11-19 09:04:24,213 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2015 transitions. Word has length 86 [2024-11-19 09:04:24,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:24,213 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2015 transitions. [2024-11-19 09:04:24,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2015 transitions. [2024-11-19 09:04:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 09:04:24,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:24,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:24,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:04:24,214 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:24,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:24,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1591552706, now seen corresponding path program 1 times [2024-11-19 09:04:24,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:24,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413926856] [2024-11-19 09:04:24,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:24,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:24,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:24,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413926856] [2024-11-19 09:04:24,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413926856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:24,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:24,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:04:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63294773] [2024-11-19 09:04:24,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:24,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:04:24,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:24,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:04:24,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:04:24,615 INFO L87 Difference]: Start difference. First operand 1564 states and 2015 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:25,420 INFO L93 Difference]: Finished difference Result 1564 states and 2013 transitions. [2024-11-19 09:04:25,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:04:25,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-11-19 09:04:25,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:25,427 INFO L225 Difference]: With dead ends: 1564 [2024-11-19 09:04:25,428 INFO L226 Difference]: Without dead ends: 1564 [2024-11-19 09:04:25,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:04:25,429 INFO L432 NwaCegarLoop]: 1228 mSDtfsCounter, 1 mSDsluCounter, 3270 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4498 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:25,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4498 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 09:04:25,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-11-19 09:04:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1564. [2024-11-19 09:04:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1178 states have (on average 1.6859083191850595) internal successors, (1986), 1551 states have internal predecessors, (1986), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-19 09:04:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2013 transitions. [2024-11-19 09:04:25,455 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2013 transitions. Word has length 86 [2024-11-19 09:04:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:25,455 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2013 transitions. [2024-11-19 09:04:25,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2013 transitions. [2024-11-19 09:04:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 09:04:25,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:25,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:25,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 09:04:25,457 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:25,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:25,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1899019630, now seen corresponding path program 1 times [2024-11-19 09:04:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:25,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552499218] [2024-11-19 09:04:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:25,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:25,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:25,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552499218] [2024-11-19 09:04:25,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552499218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:25,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049925957] [2024-11-19 09:04:25,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:25,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:04:25,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:04:25,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:04:25,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:04:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:25,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 09:04:26,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:26,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:04:26,133 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:04:26,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:04:26,145 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 19 treesize of output 1 [2024-11-19 09:04:26,189 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:26,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:04:26,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:04:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:26,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:26,261 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-19 09:04:26,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-19 09:04:26,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049925957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:26,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:04:26,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-19 09:04:26,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937147349] [2024-11-19 09:04:26,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:04:26,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:04:26,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:26,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:04:26,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=171, Unknown=4, NotChecked=0, Total=210 [2024-11-19 09:04:26,292 INFO L87 Difference]: Start difference. First operand 1564 states and 2013 transitions. Second operand has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:04:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:27,909 INFO L93 Difference]: Finished difference Result 1563 states and 2011 transitions. [2024-11-19 09:04:27,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:04:27,909 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-11-19 09:04:27,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:27,912 INFO L225 Difference]: With dead ends: 1563 [2024-11-19 09:04:27,912 INFO L226 Difference]: Without dead ends: 1563 [2024-11-19 09:04:27,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=374, Unknown=4, NotChecked=0, Total=462 [2024-11-19 09:04:27,913 INFO L432 NwaCegarLoop]: 748 mSDtfsCounter, 1151 mSDsluCounter, 5832 mSDsCounter, 0 mSdLazyCounter, 4504 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 6580 SdHoareTripleChecker+Invalid, 4525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:27,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 6580 Invalid, 4525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4504 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:04:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2024-11-19 09:04:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2024-11-19 09:04:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1178 states have (on average 1.6842105263157894) internal successors, (1984), 1550 states have internal predecessors, (1984), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-19 09:04:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2011 transitions. [2024-11-19 09:04:27,926 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2011 transitions. Word has length 87 [2024-11-19 09:04:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:27,927 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 2011 transitions. [2024-11-19 09:04:27,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:04:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2011 transitions. [2024-11-19 09:04:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 09:04:27,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:27,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:27,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:04:28,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 09:04:28,132 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:28,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1899019629, now seen corresponding path program 1 times [2024-11-19 09:04:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:28,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108386596] [2024-11-19 09:04:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:28,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:28,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-11-19 09:04:28,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:28,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108386596] [2024-11-19 09:04:28,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108386596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:28,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266077097] [2024-11-19 09:04:28,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:28,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:04:28,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:04:28,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:04:28,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:04:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:28,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 09:04:28,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:28,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:04:28,945 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:04:28,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:04:28,967 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 19 treesize of output 1 [2024-11-19 09:04:28,974 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 19 treesize of output 1 [2024-11-19 09:04:29,114 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:29,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-19 09:04:29,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-19 09:04:29,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-19 09:04:29,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-19 09:04:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:29,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:29,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:04:29,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-11-19 09:04:29,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_629 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_630 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem50#1.offset| 25))))) is different from false [2024-11-19 09:04:29,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266077097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:29,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:04:29,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-19 09:04:29,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087804702] [2024-11-19 09:04:29,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:04:29,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 09:04:29,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:29,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 09:04:29,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2024-11-19 09:04:29,318 INFO L87 Difference]: Start difference. First operand 1563 states and 2011 transitions. Second operand has 19 states, 16 states have (on average 8.5) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:04:31,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:31,773 INFO L93 Difference]: Finished difference Result 1562 states and 2009 transitions. [2024-11-19 09:04:31,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:04:31,773 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.5) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 87 [2024-11-19 09:04:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:31,776 INFO L225 Difference]: With dead ends: 1562 [2024-11-19 09:04:31,777 INFO L226 Difference]: Without dead ends: 1562 [2024-11-19 09:04:31,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=505, Unknown=1, NotChecked=46, Total=650 [2024-11-19 09:04:31,778 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1147 mSDsluCounter, 6392 mSDsCounter, 0 mSdLazyCounter, 6398 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 7139 SdHoareTripleChecker+Invalid, 6427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:31,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 7139 Invalid, 6427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 6398 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 09:04:31,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2024-11-19 09:04:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1553. [2024-11-19 09:04:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1170 states have (on average 1.6863247863247863) internal successors, (1973), 1542 states have internal predecessors, (1973), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:04:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 1991 transitions. [2024-11-19 09:04:31,792 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 1991 transitions. Word has length 87 [2024-11-19 09:04:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:31,793 INFO L471 AbstractCegarLoop]: Abstraction has 1553 states and 1991 transitions. [2024-11-19 09:04:31,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.5) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:04:31,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1991 transitions. [2024-11-19 09:04:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 09:04:31,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:31,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:31,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:31,994 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,SelfDestructingSolverStorable16 [2024-11-19 09:04:31,994 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:31,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:31,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1802103956, now seen corresponding path program 1 times [2024-11-19 09:04:31,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:31,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792088916] [2024-11-19 09:04:31,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:31,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:32,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:32,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792088916] [2024-11-19 09:04:32,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792088916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:32,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:32,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 09:04:32,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728097058] [2024-11-19 09:04:32,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:32,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:04:32,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:32,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:04:32,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:04:32,336 INFO L87 Difference]: Start difference. First operand 1553 states and 1991 transitions. Second operand has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:33,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:33,824 INFO L93 Difference]: Finished difference Result 1569 states and 2017 transitions. [2024-11-19 09:04:33,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:04:33,825 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-19 09:04:33,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:33,827 INFO L225 Difference]: With dead ends: 1569 [2024-11-19 09:04:33,827 INFO L226 Difference]: Without dead ends: 1569 [2024-11-19 09:04:33,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-19 09:04:33,828 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1178 mSDsluCounter, 5796 mSDsCounter, 0 mSdLazyCounter, 4503 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 6543 SdHoareTripleChecker+Invalid, 4524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:33,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 6543 Invalid, 4524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4503 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:04:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2024-11-19 09:04:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1568. [2024-11-19 09:04:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1184 states have (on average 1.6807432432432432) internal successors, (1990), 1555 states have internal predecessors, (1990), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-19 09:04:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2017 transitions. [2024-11-19 09:04:33,841 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2017 transitions. Word has length 89 [2024-11-19 09:04:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:33,841 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2017 transitions. [2024-11-19 09:04:33,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2017 transitions. [2024-11-19 09:04:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 09:04:33,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:33,843 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:33,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 09:04:33,843 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:33,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:33,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1802103955, now seen corresponding path program 1 times [2024-11-19 09:04:33,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:33,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119058677] [2024-11-19 09:04:33,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:33,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:34,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:34,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119058677] [2024-11-19 09:04:34,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119058677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:34,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:34,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:04:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889104675] [2024-11-19 09:04:34,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:34,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:04:34,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:34,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:04:34,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:04:34,282 INFO L87 Difference]: Start difference. First operand 1568 states and 2017 transitions. Second operand has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:36,100 INFO L93 Difference]: Finished difference Result 1568 states and 2015 transitions. [2024-11-19 09:04:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:04:36,101 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-19 09:04:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:36,103 INFO L225 Difference]: With dead ends: 1568 [2024-11-19 09:04:36,103 INFO L226 Difference]: Without dead ends: 1568 [2024-11-19 09:04:36,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:04:36,104 INFO L432 NwaCegarLoop]: 754 mSDtfsCounter, 1152 mSDsluCounter, 4208 mSDsCounter, 0 mSdLazyCounter, 4890 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 4962 SdHoareTripleChecker+Invalid, 4909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:36,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 4962 Invalid, 4909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4890 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:04:36,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2024-11-19 09:04:36,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2024-11-19 09:04:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1184 states have (on average 1.679054054054054) internal successors, (1988), 1555 states have internal predecessors, (1988), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-19 09:04:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2015 transitions. [2024-11-19 09:04:36,119 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2015 transitions. Word has length 89 [2024-11-19 09:04:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:36,120 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2015 transitions. [2024-11-19 09:04:36,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2015 transitions. [2024-11-19 09:04:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 09:04:36,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:36,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:36,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 09:04:36,121 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:36,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:36,121 INFO L85 PathProgramCache]: Analyzing trace with hash -383964681, now seen corresponding path program 1 times [2024-11-19 09:04:36,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:36,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885829355] [2024-11-19 09:04:36,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:36,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:36,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:36,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885829355] [2024-11-19 09:04:36,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885829355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:36,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637238505] [2024-11-19 09:04:36,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:36,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:04:36,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:04:36,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:04:36,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:04:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:36,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 09:04:36,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:36,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:04:36,782 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:04:36,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:04:36,788 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 19 treesize of output 1 [2024-11-19 09:04:36,828 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:36,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:04:36,861 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:36,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:04:36,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:04:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:36,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:36,880 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_879) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-19 09:04:36,885 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-19 09:04:36,912 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-19 09:04:36,912 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 33 treesize of output 32 [2024-11-19 09:04:36,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637238505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:36,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:04:36,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-19 09:04:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230533835] [2024-11-19 09:04:36,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:04:36,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:04:36,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:36,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:04:36,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=8, NotChecked=62, Total=342 [2024-11-19 09:04:36,941 INFO L87 Difference]: Start difference. First operand 1568 states and 2015 transitions. Second operand has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:38,507 INFO L93 Difference]: Finished difference Result 1567 states and 2013 transitions. [2024-11-19 09:04:38,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:04:38,507 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-19 09:04:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:38,509 INFO L225 Difference]: With dead ends: 1567 [2024-11-19 09:04:38,509 INFO L226 Difference]: Without dead ends: 1567 [2024-11-19 09:04:38,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=8, NotChecked=90, Total=650 [2024-11-19 09:04:38,510 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1147 mSDsluCounter, 5818 mSDsCounter, 0 mSdLazyCounter, 4518 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 6565 SdHoareTripleChecker+Invalid, 4538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:38,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 6565 Invalid, 4538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4518 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:04:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-19 09:04:38,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2024-11-19 09:04:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1184 states have (on average 1.677364864864865) internal successors, (1986), 1554 states have internal predecessors, (1986), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-19 09:04:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2013 transitions. [2024-11-19 09:04:38,522 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2013 transitions. Word has length 90 [2024-11-19 09:04:38,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:38,522 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2013 transitions. [2024-11-19 09:04:38,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2013 transitions. [2024-11-19 09:04:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 09:04:38,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:38,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:38,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:38,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:04:38,723 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:38,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:38,724 INFO L85 PathProgramCache]: Analyzing trace with hash -383964680, now seen corresponding path program 1 times [2024-11-19 09:04:38,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:38,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794074757] [2024-11-19 09:04:38,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:38,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:39,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:39,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794074757] [2024-11-19 09:04:39,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794074757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:39,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293398269] [2024-11-19 09:04:39,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:39,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:04:39,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:04:39,234 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:04:39,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:04:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:39,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 09:04:39,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:39,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:04:39,494 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:04:39,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:04:39,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:04:39,518 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 19 treesize of output 1 [2024-11-19 09:04:39,520 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 13 treesize of output 9 [2024-11-19 09:04:39,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 09:04:39,584 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 9 treesize of output 3 [2024-11-19 09:04:39,657 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:39,657 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-11-19 09:04:39,662 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 30 treesize of output 13 [2024-11-19 09:04:39,715 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:39,715 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-11-19 09:04:39,720 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 30 treesize of output 13 [2024-11-19 09:04:39,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:04:39,735 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 9 treesize of output 3 [2024-11-19 09:04:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:39,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:39,786 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 09:04:39,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1019 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-19 09:04:39,831 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-19 09:04:39,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293398269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:39,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:04:39,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-19 09:04:39,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035451444] [2024-11-19 09:04:39,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:04:39,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 09:04:39,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:39,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 09:04:39,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=397, Unknown=3, NotChecked=126, Total=600 [2024-11-19 09:04:39,836 INFO L87 Difference]: Start difference. First operand 1567 states and 2013 transitions. Second operand has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:04:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:43,252 INFO L93 Difference]: Finished difference Result 1574 states and 2019 transitions. [2024-11-19 09:04:43,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:04:43,252 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 90 [2024-11-19 09:04:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:43,255 INFO L225 Difference]: With dead ends: 1574 [2024-11-19 09:04:43,255 INFO L226 Difference]: Without dead ends: 1574 [2024-11-19 09:04:43,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=594, Unknown=3, NotChecked=156, Total=870 [2024-11-19 09:04:43,255 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1145 mSDsluCounter, 8398 mSDsCounter, 0 mSdLazyCounter, 9257 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 9150 SdHoareTripleChecker+Invalid, 9279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 9257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:43,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 9150 Invalid, 9279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 9257 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 09:04:43,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2024-11-19 09:04:43,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1556. [2024-11-19 09:04:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1174 states have (on average 1.6814310051107326) internal successors, (1974), 1544 states have internal predecessors, (1974), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:04:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1992 transitions. [2024-11-19 09:04:43,277 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1992 transitions. Word has length 90 [2024-11-19 09:04:43,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:43,278 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 1992 transitions. [2024-11-19 09:04:43,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:04:43,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1992 transitions. [2024-11-19 09:04:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 09:04:43,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:43,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:43,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 09:04:43,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:04:43,479 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:43,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:43,479 INFO L85 PathProgramCache]: Analyzing trace with hash 612863492, now seen corresponding path program 1 times [2024-11-19 09:04:43,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:43,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406161806] [2024-11-19 09:04:43,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:43,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:43,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:43,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406161806] [2024-11-19 09:04:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406161806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:43,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:43,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 09:04:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872799470] [2024-11-19 09:04:43,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:43,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 09:04:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 09:04:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:04:43,846 INFO L87 Difference]: Start difference. First operand 1556 states and 1992 transitions. Second operand has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:45,320 INFO L93 Difference]: Finished difference Result 1581 states and 2027 transitions. [2024-11-19 09:04:45,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:04:45,320 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-19 09:04:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:45,322 INFO L225 Difference]: With dead ends: 1581 [2024-11-19 09:04:45,322 INFO L226 Difference]: Without dead ends: 1581 [2024-11-19 09:04:45,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-19 09:04:45,323 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1157 mSDsluCounter, 5795 mSDsCounter, 0 mSdLazyCounter, 4525 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 6541 SdHoareTripleChecker+Invalid, 4545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:45,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 6541 Invalid, 4545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4525 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:04:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-11-19 09:04:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1577. [2024-11-19 09:04:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1194 states have (on average 1.6725293132328307) internal successors, (1997), 1563 states have internal predecessors, (1997), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-19 09:04:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2017 transitions. [2024-11-19 09:04:45,334 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2017 transitions. Word has length 92 [2024-11-19 09:04:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:45,334 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2017 transitions. [2024-11-19 09:04:45,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2017 transitions. [2024-11-19 09:04:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 09:04:45,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:45,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:45,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 09:04:45,335 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:45,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:45,336 INFO L85 PathProgramCache]: Analyzing trace with hash 612863493, now seen corresponding path program 1 times [2024-11-19 09:04:45,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:45,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25004101] [2024-11-19 09:04:45,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:45,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:45,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25004101] [2024-11-19 09:04:45,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25004101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:45,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:45,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 09:04:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175535960] [2024-11-19 09:04:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:45,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:04:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:04:45,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:04:45,831 INFO L87 Difference]: Start difference. First operand 1577 states and 2017 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:47,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:47,114 INFO L93 Difference]: Finished difference Result 1580 states and 2025 transitions. [2024-11-19 09:04:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:04:47,115 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-19 09:04:47,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:47,117 INFO L225 Difference]: With dead ends: 1580 [2024-11-19 09:04:47,117 INFO L226 Difference]: Without dead ends: 1580 [2024-11-19 09:04:47,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-19 09:04:47,117 INFO L432 NwaCegarLoop]: 753 mSDtfsCounter, 1172 mSDsluCounter, 3117 mSDsCounter, 0 mSdLazyCounter, 3533 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 3552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:47,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 3870 Invalid, 3552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3533 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:04:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-11-19 09:04:47,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1577. [2024-11-19 09:04:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1194 states have (on average 1.670854271356784) internal successors, (1995), 1563 states have internal predecessors, (1995), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-19 09:04:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2015 transitions. [2024-11-19 09:04:47,129 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2015 transitions. Word has length 92 [2024-11-19 09:04:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:47,129 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2015 transitions. [2024-11-19 09:04:47,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:47,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2015 transitions. [2024-11-19 09:04:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 09:04:47,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:47,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:47,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 09:04:47,130 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:47,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:47,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1193285735, now seen corresponding path program 1 times [2024-11-19 09:04:47,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:47,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616822422] [2024-11-19 09:04:47,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:47,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:47,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:47,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616822422] [2024-11-19 09:04:47,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616822422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:47,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405745727] [2024-11-19 09:04:47,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:47,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:04:47,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:04:47,503 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:04:47,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 09:04:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:47,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 09:04:47,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:47,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:04:47,737 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:04:47,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:04:47,748 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 19 treesize of output 1 [2024-11-19 09:04:47,779 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:47,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:04:47,808 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:47,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:04:47,843 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:47,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:04:47,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:04:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:47,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:47,903 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1299))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1300)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 09:04:47,950 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-19 09:04:47,950 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 57 treesize of output 56 [2024-11-19 09:04:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405745727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:47,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:04:47,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2024-11-19 09:04:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991958857] [2024-11-19 09:04:47,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:04:47,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:04:47,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:47,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:04:47,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=370, Unknown=23, NotChecked=40, Total=506 [2024-11-19 09:04:47,985 INFO L87 Difference]: Start difference. First operand 1577 states and 2015 transitions. Second operand has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:49,908 INFO L93 Difference]: Finished difference Result 1579 states and 2023 transitions. [2024-11-19 09:04:49,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 09:04:49,909 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-19 09:04:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:49,911 INFO L225 Difference]: With dead ends: 1579 [2024-11-19 09:04:49,911 INFO L226 Difference]: Without dead ends: 1579 [2024-11-19 09:04:49,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=705, Unknown=23, NotChecked=56, Total=930 [2024-11-19 09:04:49,912 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1141 mSDsluCounter, 7945 mSDsCounter, 0 mSdLazyCounter, 5982 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 8691 SdHoareTripleChecker+Invalid, 6002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:49,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 8691 Invalid, 6002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5982 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 09:04:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2024-11-19 09:04:49,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1576. [2024-11-19 09:04:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1194 states have (on average 1.669179229480737) internal successors, (1993), 1562 states have internal predecessors, (1993), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-19 09:04:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2013 transitions. [2024-11-19 09:04:49,924 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2013 transitions. Word has length 93 [2024-11-19 09:04:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:49,924 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2013 transitions. [2024-11-19 09:04:49,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2013 transitions. [2024-11-19 09:04:49,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 09:04:49,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:49,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:49,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 09:04:50,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 09:04:50,126 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:50,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:50,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1193285734, now seen corresponding path program 1 times [2024-11-19 09:04:50,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:50,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170696463] [2024-11-19 09:04:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:50,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:50,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:50,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170696463] [2024-11-19 09:04:50,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170696463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:50,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197452001] [2024-11-19 09:04:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:50,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:04:50,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:04:50,682 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:04:50,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 09:04:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:50,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-19 09:04:50,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:50,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:04:50,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:04:50,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:04:50,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:04:50,959 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 13 treesize of output 9 [2024-11-19 09:04:50,962 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 19 treesize of output 1 [2024-11-19 09:04:50,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 09:04:50,994 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 9 treesize of output 3 [2024-11-19 09:04:51,053 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:51,054 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-11-19 09:04:51,057 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 30 treesize of output 13 [2024-11-19 09:04:51,095 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:51,095 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-11-19 09:04:51,100 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 30 treesize of output 13 [2024-11-19 09:04:51,139 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:51,139 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-11-19 09:04:51,142 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 30 treesize of output 13 [2024-11-19 09:04:51,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:04:51,156 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 9 treesize of output 3 [2024-11-19 09:04:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:51,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:51,192 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 09:04:51,199 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-19 09:04:51,211 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-19 09:04:51,220 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2024-11-19 09:04:51,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse0 v_ArrVal_1453) (select (select (store .cse1 .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1452))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse3 v_ArrVal_1453) .cse4 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-19 09:04:51,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197452001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:51,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:04:51,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2024-11-19 09:04:51,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324355500] [2024-11-19 09:04:51,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:04:51,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:04:51,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:51,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:04:51,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2024-11-19 09:04:51,261 INFO L87 Difference]: Start difference. First operand 1576 states and 2013 transitions. Second operand has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:04:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:53,541 INFO L93 Difference]: Finished difference Result 1578 states and 2021 transitions. [2024-11-19 09:04:53,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:04:53,541 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2024-11-19 09:04:53,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:53,543 INFO L225 Difference]: With dead ends: 1578 [2024-11-19 09:04:53,543 INFO L226 Difference]: Without dead ends: 1578 [2024-11-19 09:04:53,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2024-11-19 09:04:53,544 INFO L432 NwaCegarLoop]: 751 mSDtfsCounter, 1142 mSDsluCounter, 4953 mSDsCounter, 0 mSdLazyCounter, 5375 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 5704 SdHoareTripleChecker+Invalid, 5396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:53,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 5704 Invalid, 5396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5375 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 09:04:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-19 09:04:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1554. [2024-11-19 09:04:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1174 states have (on average 1.678023850085179) internal successors, (1970), 1542 states have internal predecessors, (1970), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:04:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1988 transitions. [2024-11-19 09:04:53,555 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1988 transitions. Word has length 93 [2024-11-19 09:04:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:53,555 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 1988 transitions. [2024-11-19 09:04:53,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:04:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1988 transitions. [2024-11-19 09:04:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 09:04:53,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:53,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:53,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:53,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:04:53,757 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:53,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:53,758 INFO L85 PathProgramCache]: Analyzing trace with hash -89061485, now seen corresponding path program 1 times [2024-11-19 09:04:53,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:53,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125095165] [2024-11-19 09:04:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:53,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125095165] [2024-11-19 09:04:54,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125095165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:54,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:54,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 09:04:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167645608] [2024-11-19 09:04:54,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:54,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:04:54,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:54,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:04:54,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-19 09:04:54,129 INFO L87 Difference]: Start difference. First operand 1554 states and 1988 transitions. Second operand has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:55,757 INFO L93 Difference]: Finished difference Result 1585 states and 2029 transitions. [2024-11-19 09:04:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 09:04:55,757 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-19 09:04:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:55,759 INFO L225 Difference]: With dead ends: 1585 [2024-11-19 09:04:55,759 INFO L226 Difference]: Without dead ends: 1585 [2024-11-19 09:04:55,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-19 09:04:55,760 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1174 mSDsluCounter, 6547 mSDsCounter, 0 mSdLazyCounter, 5026 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 7292 SdHoareTripleChecker+Invalid, 5046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:55,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 7292 Invalid, 5046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5026 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:04:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-11-19 09:04:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1581. [2024-11-19 09:04:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1200 states have (on average 1.6658333333333333) internal successors, (1999), 1567 states have internal predecessors, (1999), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-19 09:04:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2019 transitions. [2024-11-19 09:04:55,771 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2019 transitions. Word has length 95 [2024-11-19 09:04:55,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:55,771 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2019 transitions. [2024-11-19 09:04:55,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:55,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2019 transitions. [2024-11-19 09:04:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 09:04:55,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:55,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:55,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 09:04:55,772 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:55,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:55,773 INFO L85 PathProgramCache]: Analyzing trace with hash -89061484, now seen corresponding path program 1 times [2024-11-19 09:04:55,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:55,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545676876] [2024-11-19 09:04:55,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:55,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:56,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:56,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545676876] [2024-11-19 09:04:56,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545676876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:56,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:56,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 09:04:56,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459984517] [2024-11-19 09:04:56,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:56,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:04:56,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:56,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:04:56,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:04:56,290 INFO L87 Difference]: Start difference. First operand 1581 states and 2019 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:57,989 INFO L93 Difference]: Finished difference Result 1584 states and 2027 transitions. [2024-11-19 09:04:57,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:04:57,990 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-19 09:04:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:57,991 INFO L225 Difference]: With dead ends: 1584 [2024-11-19 09:04:57,991 INFO L226 Difference]: Without dead ends: 1584 [2024-11-19 09:04:57,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-19 09:04:57,992 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1154 mSDsluCounter, 4368 mSDsCounter, 0 mSdLazyCounter, 4718 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 5120 SdHoareTripleChecker+Invalid, 4737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:57,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 5120 Invalid, 4737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4718 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 09:04:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-11-19 09:04:58,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1581. [2024-11-19 09:04:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1200 states have (on average 1.6641666666666666) internal successors, (1997), 1567 states have internal predecessors, (1997), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-19 09:04:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2017 transitions. [2024-11-19 09:04:58,003 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2017 transitions. Word has length 95 [2024-11-19 09:04:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:58,003 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2017 transitions. [2024-11-19 09:04:58,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2017 transitions. [2024-11-19 09:04:58,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 09:04:58,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:58,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:58,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 09:04:58,004 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:04:58,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:58,004 INFO L85 PathProgramCache]: Analyzing trace with hash 269601246, now seen corresponding path program 1 times [2024-11-19 09:04:58,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:04:58,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445398490] [2024-11-19 09:04:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:04:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:58,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:04:58,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445398490] [2024-11-19 09:04:58,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445398490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:58,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075152446] [2024-11-19 09:04:58,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:58,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:04:58,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:04:58,444 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:04:58,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 09:04:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:58,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 09:04:58,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:58,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:04:58,704 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:04:58,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:04:58,711 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 19 treesize of output 1 [2024-11-19 09:04:58,777 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:58,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:04:58,813 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:58,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:04:58,848 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:58,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:04:58,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:58,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:04:58,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:04:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:58,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:58,895 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-19 09:04:58,919 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1759))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 09:04:58,922 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 09:04:58,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1758))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 09:04:58,932 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1758))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 09:04:58,956 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-19 09:04:58,957 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 105 treesize of output 104 [2024-11-19 09:04:58,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075152446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:58,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:04:58,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2024-11-19 09:04:58,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398243728] [2024-11-19 09:04:58,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:04:58,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 09:04:58,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:04:58,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 09:04:58,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=467, Unknown=15, NotChecked=240, Total=812 [2024-11-19 09:04:58,997 INFO L87 Difference]: Start difference. First operand 1581 states and 2017 transitions. Second operand has 22 states, 19 states have (on average 7.684210526315789) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:05:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:01,368 INFO L93 Difference]: Finished difference Result 1583 states and 2025 transitions. [2024-11-19 09:05:01,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:05:01,369 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.684210526315789) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-19 09:05:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:01,371 INFO L225 Difference]: With dead ends: 1583 [2024-11-19 09:05:01,371 INFO L226 Difference]: Without dead ends: 1583 [2024-11-19 09:05:01,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=891, Unknown=15, NotChecked=330, Total=1406 [2024-11-19 09:05:01,371 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1143 mSDsluCounter, 10144 mSDsCounter, 0 mSdLazyCounter, 7480 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 10889 SdHoareTripleChecker+Invalid, 7500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:01,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 10889 Invalid, 7500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 7480 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 09:05:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2024-11-19 09:05:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1580. [2024-11-19 09:05:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1200 states have (on average 1.6625) internal successors, (1995), 1566 states have internal predecessors, (1995), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-19 09:05:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2015 transitions. [2024-11-19 09:05:01,382 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2015 transitions. Word has length 96 [2024-11-19 09:05:01,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:01,383 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2015 transitions. [2024-11-19 09:05:01,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.684210526315789) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:05:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2015 transitions. [2024-11-19 09:05:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 09:05:01,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:01,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:05:01,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 09:05:01,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:01,588 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:05:01,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash 269601247, now seen corresponding path program 1 times [2024-11-19 09:05:01,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:01,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337911082] [2024-11-19 09:05:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:02,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:02,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337911082] [2024-11-19 09:05:02,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337911082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:02,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23988870] [2024-11-19 09:05:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:02,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:02,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:05:02,230 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:05:02,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 09:05:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:02,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-19 09:05:02,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:02,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:05:02,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:05:02,493 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:05:02,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:05:02,498 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 19 treesize of output 1 [2024-11-19 09:05:02,501 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 13 treesize of output 9 [2024-11-19 09:05:02,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 09:05:02,532 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 9 treesize of output 3 [2024-11-19 09:05:02,586 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:02,587 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-11-19 09:05:02,590 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 30 treesize of output 13 [2024-11-19 09:05:02,637 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:02,637 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-11-19 09:05:02,642 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 30 treesize of output 13 [2024-11-19 09:05:02,675 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:02,675 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-11-19 09:05:02,681 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 30 treesize of output 13 [2024-11-19 09:05:02,721 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:02,721 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-11-19 09:05:02,723 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 30 treesize of output 13 [2024-11-19 09:05:02,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:05:02,738 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 9 treesize of output 3 [2024-11-19 09:05:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:02,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:05:02,777 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 09:05:02,784 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-19 09:05:02,794 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-19 09:05:02,802 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-19 09:05:02,817 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1924) .cse0 v_ArrVal_1927) (select (select (store .cse1 .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1926))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1924) .cse3 v_ArrVal_1927) .cse4 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-19 09:05:02,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1926))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse4 v_ArrVal_1927) .cse5 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-19 09:05:02,882 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1925))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1926))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse5 v_ArrVal_1924) .cse6 v_ArrVal_1927) .cse7 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-19 09:05:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23988870] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:02,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:05:02,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2024-11-19 09:05:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248771992] [2024-11-19 09:05:02,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:05:02,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 09:05:02,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:02,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 09:05:02,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=394, Unknown=7, NotChecked=322, Total=812 [2024-11-19 09:05:02,886 INFO L87 Difference]: Start difference. First operand 1580 states and 2015 transitions. Second operand has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:05:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:04,475 INFO L93 Difference]: Finished difference Result 1582 states and 2023 transitions. [2024-11-19 09:05:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 09:05:04,476 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-19 09:05:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:04,477 INFO L225 Difference]: With dead ends: 1582 [2024-11-19 09:05:04,477 INFO L226 Difference]: Without dead ends: 1582 [2024-11-19 09:05:04,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=690, Unknown=7, NotChecked=420, Total=1260 [2024-11-19 09:05:04,478 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 1140 mSDsluCounter, 3868 mSDsCounter, 0 mSdLazyCounter, 4053 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 4618 SdHoareTripleChecker+Invalid, 4075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:04,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 4618 Invalid, 4075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4053 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:05:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2024-11-19 09:05:04,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1552. [2024-11-19 09:05:04,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1174 states have (on average 1.6746166950596253) internal successors, (1966), 1540 states have internal predecessors, (1966), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 09:05:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 1984 transitions. [2024-11-19 09:05:04,492 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 1984 transitions. Word has length 96 [2024-11-19 09:05:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:04,492 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 1984 transitions. [2024-11-19 09:05:04,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:05:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1984 transitions. [2024-11-19 09:05:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 09:05:04,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:04,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:05:04,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 09:05:04,693 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,SelfDestructingSolverStorable28 [2024-11-19 09:05:04,694 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:05:04,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1508421354, now seen corresponding path program 1 times [2024-11-19 09:05:04,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:04,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43747745] [2024-11-19 09:05:04,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:04,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:05,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:05,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43747745] [2024-11-19 09:05:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43747745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:05,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:05,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-19 09:05:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254576479] [2024-11-19 09:05:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:05,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:05:05,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:05,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:05:05,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-19 09:05:05,541 INFO L87 Difference]: Start difference. First operand 1552 states and 1984 transitions. Second operand has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:05:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:07,874 INFO L93 Difference]: Finished difference Result 1590 states and 2031 transitions. [2024-11-19 09:05:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:05:07,875 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-19 09:05:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:07,876 INFO L225 Difference]: With dead ends: 1590 [2024-11-19 09:05:07,876 INFO L226 Difference]: Without dead ends: 1590 [2024-11-19 09:05:07,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-19 09:05:07,877 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 1178 mSDsluCounter, 6517 mSDsCounter, 0 mSdLazyCounter, 6223 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 7261 SdHoareTripleChecker+Invalid, 6249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:07,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 7261 Invalid, 6249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 6223 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 09:05:07,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-11-19 09:05:07,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1587. [2024-11-19 09:05:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1208 states have (on average 1.656456953642384) internal successors, (2001), 1573 states have internal predecessors, (2001), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-19 09:05:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2021 transitions. [2024-11-19 09:05:07,889 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2021 transitions. Word has length 99 [2024-11-19 09:05:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:07,889 INFO L471 AbstractCegarLoop]: Abstraction has 1587 states and 2021 transitions. [2024-11-19 09:05:07,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:05:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2021 transitions. [2024-11-19 09:05:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 09:05:07,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:07,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:05:07,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 09:05:07,890 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:05:07,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:07,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1117260319, now seen corresponding path program 1 times [2024-11-19 09:05:07,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:05:07,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452306849] [2024-11-19 09:05:07,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:07,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:05:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:08,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:05:08,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452306849] [2024-11-19 09:05:08,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452306849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:08,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599160450] [2024-11-19 09:05:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:08,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:05:08,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:05:08,689 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:05:08,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 09:05:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:08,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-19 09:05:08,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:08,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:05:08,949 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:05:08,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:05:08,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:05:08,967 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 19 treesize of output 1 [2024-11-19 09:05:08,969 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 13 treesize of output 9 [2024-11-19 09:05:09,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 09:05:09,022 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 9 treesize of output 3 [2024-11-19 09:05:09,114 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:09,115 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 73 treesize of output 66 [2024-11-19 09:05:09,118 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 30 treesize of output 13 [2024-11-19 09:05:09,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:09,200 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 73 treesize of output 66 [2024-11-19 09:05:09,203 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 30 treesize of output 13 [2024-11-19 09:05:09,269 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:09,269 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 73 treesize of output 66 [2024-11-19 09:05:09,272 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 30 treesize of output 13 [2024-11-19 09:05:09,343 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:09,343 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 73 treesize of output 66 [2024-11-19 09:05:09,346 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 30 treesize of output 13 [2024-11-19 09:05:09,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:05:09,413 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 73 treesize of output 66 [2024-11-19 09:05:09,417 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 30 treesize of output 13 [2024-11-19 09:05:09,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-19 09:05:09,437 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 9 treesize of output 3 [2024-11-19 09:05:09,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:05:09,477 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-19 09:05:09,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-19 09:05:09,484 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:05:09,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:05:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:09,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:05:09,778 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0))) (forall ((v_ArrVal_2197 (Array Int Int)) (v_ArrVal_2195 (Array Int Int)) (v_ArrVal_2194 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2195) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (v_ArrVal_2197 (Array Int Int)) (v_ArrVal_2196 (Array Int Int)) (v_ArrVal_2195 (Array Int Int)) (v_ArrVal_2194 (Array Int Int))) (or (forall ((v_ArrVal_2198 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2194))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2195) .cse1 v_ArrVal_2197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| v_ArrVal_2198) (select (select (store .cse2 .cse1 v_ArrVal_2196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0)))))) is different from false [2024-11-19 09:05:09,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2193 (Array Int Int)) (v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2197 (Array Int Int)) (v_ArrVal_2195 (Array Int Int)) (v_ArrVal_2194 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2192))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2193) .cse0 v_ArrVal_2195) (select (select (store .cse1 .cse0 v_ArrVal_2194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2197))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0)))) (forall ((v_ArrVal_2193 (Array Int Int)) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (v_ArrVal_2197 (Array Int Int)) (v_ArrVal_2196 (Array Int Int)) (v_ArrVal_2195 (Array Int Int)) (v_ArrVal_2194 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0)) (forall ((v_ArrVal_2198 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2192))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2194))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2193) .cse3 v_ArrVal_2195) .cse4 v_ArrVal_2197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| v_ArrVal_2198) (select (select (store .cse5 .cse4 v_ArrVal_2196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2024-11-19 09:05:10,130 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0))) (forall ((v_ArrVal_2193 (Array Int Int)) (v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2191 (Array Int Int)) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2197 (Array Int Int)) (v_ArrVal_2195 (Array Int Int)) (v_ArrVal_2194 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2191))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2192))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2190) .cse0 v_ArrVal_2193) .cse1 v_ArrVal_2195) (select (select (store .cse2 .cse1 v_ArrVal_2194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2197))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2193 (Array Int Int)) (v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2191 (Array Int Int)) (v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (v_ArrVal_2197 (Array Int Int)) (v_ArrVal_2196 (Array Int Int)) (v_ArrVal_2195 (Array Int Int)) (v_ArrVal_2194 (Array Int Int))) (or (forall ((v_ArrVal_2198 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2191))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2192))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2194))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2190) .cse5 v_ArrVal_2193) .cse6 v_ArrVal_2195) .cse7 v_ArrVal_2197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| v_ArrVal_2198) (select (select (store .cse8 .cse7 v_ArrVal_2196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0)))))) is different from false [2024-11-19 09:05:18,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:05:18,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-19 09:05:19,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_23 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2198 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_ArrVal_2196 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_22))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_prenex_19))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_prenex_18))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_prenex_26))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_21) .cse0 v_prenex_20) .cse1 v_prenex_17) .cse2 v_prenex_25) .cse3 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_23 v_ArrVal_2198) (select (select (store .cse5 .cse3 v_ArrVal_2196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_23))) (forall ((v_ArrVal_2193 (Array Int Int)) (v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2191 (Array Int Int)) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2204 (Array Int Int)) (v_ArrVal_2203 (Array Int Int)) (v_ArrVal_2197 (Array Int Int)) (v_ArrVal_2195 (Array Int Int)) (v_ArrVal_2194 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2203))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2191))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2192))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2204) .cse9 v_ArrVal_2190) .cse10 v_ArrVal_2193) .cse11 v_ArrVal_2195) (select (select (store .cse12 .cse11 v_ArrVal_2194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2197))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-19 09:05:19,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599160450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:05:19,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:05:19,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-19 09:05:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272455283] [2024-11-19 09:05:19,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:05:19,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 09:05:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:05:19,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 09:05:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1356, Unknown=29, NotChecked=316, Total=1892 [2024-11-19 09:05:19,064 INFO L87 Difference]: Start difference. First operand 1587 states and 2021 transitions. Second operand has 32 states, 29 states have (on average 5.586206896551724) internal successors, (162), 30 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)