./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-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_BER_test1-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 a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 08:57:11,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 08:57:11,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 08:57:11,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 08:57:11,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 08:57:11,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 08:57:11,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 08:57:11,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 08:57:11,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 08:57:11,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 08:57:11,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 08:57:11,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 08:57:11,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 08:57:11,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 08:57:11,981 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 08:57:11,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 08:57:11,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 08:57:11,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 08:57:11,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 08:57:11,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 08:57:11,983 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 08:57:11,983 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 08:57:11,983 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 08:57:11,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 08:57:11,984 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 08:57:11,984 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 08:57:11,984 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 08:57:11,984 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 08:57:11,984 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 08:57:11,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 08:57:11,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 08:57:11,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 08:57:11,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 08:57:11,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:57:11,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 08:57:11,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 08:57:11,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 08:57:11,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 08:57:11,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 08:57:11,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 08:57:11,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 08:57:11,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 08:57:11,989 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 -> a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 [2024-11-19 08:57:12,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 08:57:12,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 08:57:12,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 08:57:12,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 08:57:12,226 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 08:57:12,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2024-11-19 08:57:13,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 08:57:13,865 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 08:57:13,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2024-11-19 08:57:13,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ac0eafd/6850f0da51cc47bc9893818121f26525/FLAG9a4424732 [2024-11-19 08:57:13,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ac0eafd/6850f0da51cc47bc9893818121f26525 [2024-11-19 08:57:13,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 08:57:13,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 08:57:13,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 08:57:13,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 08:57:13,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 08:57:13,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:57:13" (1/1) ... [2024-11-19 08:57:13,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73408a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:13, skipping insertion in model container [2024-11-19 08:57:13,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:57:13" (1/1) ... [2024-11-19 08:57:13,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 08:57:14,312 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 08:57:14,335 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 08:57:14,338 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 08:57:14,341 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 08:57:14,345 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 08:57:14,354 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 08:57:14,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:57:14,366 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 08:57:14,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:57:14,567 INFO L204 MainTranslator]: Completed translation [2024-11-19 08:57:14,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14 WrapperNode [2024-11-19 08:57:14,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 08:57:14,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 08:57:14,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 08:57:14,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 08:57:14,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14" (1/1) ... [2024-11-19 08:57:14,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14" (1/1) ... [2024-11-19 08:57:14,653 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 849 [2024-11-19 08:57:14,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 08:57:14,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 08:57:14,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 08:57:14,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 08:57:14,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14" (1/1) ... [2024-11-19 08:57:14,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14" (1/1) ... [2024-11-19 08:57:14,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14" (1/1) ... [2024-11-19 08:57:14,746 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-19 08:57:14,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14" (1/1) ... [2024-11-19 08:57:14,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14" (1/1) ... [2024-11-19 08:57:14,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14" (1/1) ... [2024-11-19 08:57:14,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14" (1/1) ... [2024-11-19 08:57:14,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14" (1/1) ... [2024-11-19 08:57:14,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14" (1/1) ... [2024-11-19 08:57:14,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 08:57:14,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 08:57:14,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 08:57:14,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 08:57:14,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14" (1/1) ... [2024-11-19 08:57:14,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:57:14,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:14,822 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 08:57:14,825 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 08:57:14,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 08:57:14,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 08:57:14,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 08:57:14,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 08:57:14,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 08:57:14,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 08:57:14,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 08:57:14,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 08:57:14,867 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 08:57:14,867 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 08:57:14,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 08:57:14,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 08:57:14,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 08:57:14,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 08:57:14,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 08:57:14,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 08:57:14,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 08:57:14,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 08:57:14,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 08:57:14,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 08:57:14,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 08:57:15,029 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 08:57:15,030 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 08:57:15,034 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 08:57:15,071 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 08:57:16,400 INFO L? ?]: Removed 775 outVars from TransFormulas that were not future-live. [2024-11-19 08:57:16,401 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 08:57:16,422 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 08:57:16,422 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-19 08:57:16,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:57:16 BoogieIcfgContainer [2024-11-19 08:57:16,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 08:57:16,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 08:57:16,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 08:57:16,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 08:57:16,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:57:13" (1/3) ... [2024-11-19 08:57:16,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f27f8ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:57:16, skipping insertion in model container [2024-11-19 08:57:16,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:14" (2/3) ... [2024-11-19 08:57:16,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f27f8ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:57:16, skipping insertion in model container [2024-11-19 08:57:16,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:57:16" (3/3) ... [2024-11-19 08:57:16,429 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test1-1.i [2024-11-19 08:57:16,444 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 08:57:16,445 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-19 08:57:16,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 08:57:16,498 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;@5a00a7a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 08:57:16,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-19 08:57:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 758 states, 425 states have (on average 2.061176470588235) internal successors, (876), 752 states have internal predecessors, (876), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 08:57:16,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:16,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 08:57:16,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:16,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:16,514 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-19 08:57:16,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:16,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44770789] [2024-11-19 08:57:16,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:16,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:16,714 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 08:57:16,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:16,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44770789] [2024-11-19 08:57:16,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44770789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:16,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:16,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:57:16,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594919803] [2024-11-19 08:57:16,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:16,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:16,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:16,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:16,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:16,753 INFO L87 Difference]: Start difference. First operand has 758 states, 425 states have (on average 2.061176470588235) internal successors, (876), 752 states have internal predecessors, (876), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:17,312 INFO L93 Difference]: Finished difference Result 701 states and 809 transitions. [2024-11-19 08:57:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:17,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 08:57:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:17,334 INFO L225 Difference]: With dead ends: 701 [2024-11-19 08:57:17,334 INFO L226 Difference]: Without dead ends: 699 [2024-11-19 08:57:17,336 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 08:57:17,340 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 697 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:17,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 510 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 08:57:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-19 08:57:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2024-11-19 08:57:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 419 states have (on average 1.8568019093078758) internal successors, (778), 691 states have internal predecessors, (778), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 804 transitions. [2024-11-19 08:57:17,395 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 804 transitions. Word has length 5 [2024-11-19 08:57:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:17,396 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 804 transitions. [2024-11-19 08:57:17,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 08:57:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 804 transitions. [2024-11-19 08:57:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 08:57:17,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:17,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 08:57:17,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 08:57:17,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:17,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:17,398 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-19 08:57:17,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:17,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103836624] [2024-11-19 08:57:17,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:17,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:17,491 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 08:57:17,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:17,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103836624] [2024-11-19 08:57:17,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103836624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:17,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:17,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:57:17,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681508849] [2024-11-19 08:57:17,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:17,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:17,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:17,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:17,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:17,494 INFO L87 Difference]: Start difference. First operand 697 states and 804 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:17,950 INFO L93 Difference]: Finished difference Result 775 states and 888 transitions. [2024-11-19 08:57:17,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:17,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 08:57:17,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:17,953 INFO L225 Difference]: With dead ends: 775 [2024-11-19 08:57:17,954 INFO L226 Difference]: Without dead ends: 775 [2024-11-19 08:57:17,954 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 08:57:17,955 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 412 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:17,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 913 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 08:57:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-19 08:57:17,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 727. [2024-11-19 08:57:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 459 states have (on average 1.8453159041394336) internal successors, (847), 721 states have internal predecessors, (847), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 873 transitions. [2024-11-19 08:57:18,000 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 873 transitions. Word has length 5 [2024-11-19 08:57:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:18,000 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 873 transitions. [2024-11-19 08:57:18,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 08:57:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 873 transitions. [2024-11-19 08:57:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 08:57:18,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:18,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 08:57:18,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 08:57:18,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:18,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:18,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1423336739, now seen corresponding path program 1 times [2024-11-19 08:57:18,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:18,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598177971] [2024-11-19 08:57:18,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:18,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:18,029 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 08:57:18,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:18,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598177971] [2024-11-19 08:57:18,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598177971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:18,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:18,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:18,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62614639] [2024-11-19 08:57:18,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:18,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:18,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:18,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:18,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:18,032 INFO L87 Difference]: Start difference. First operand 727 states and 873 transitions. Second operand has 3 states, 3 states have (on average 2.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 08:57:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:18,073 INFO L93 Difference]: Finished difference Result 1404 states and 1676 transitions. [2024-11-19 08:57:18,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:18,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.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 08:57:18,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:18,080 INFO L225 Difference]: With dead ends: 1404 [2024-11-19 08:57:18,080 INFO L226 Difference]: Without dead ends: 1404 [2024-11-19 08:57:18,080 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 08:57:18,081 INFO L432 NwaCegarLoop]: 790 mSDtfsCounter, 717 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:18,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1578 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:18,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2024-11-19 08:57:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 728. [2024-11-19 08:57:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 460 states have (on average 1.8434782608695652) internal successors, (848), 722 states have internal predecessors, (848), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 874 transitions. [2024-11-19 08:57:18,103 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 874 transitions. Word has length 6 [2024-11-19 08:57:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:18,103 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 874 transitions. [2024-11-19 08:57:18,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.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 08:57:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 874 transitions. [2024-11-19 08:57:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 08:57:18,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:18,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:18,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 08:57:18,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:18,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:18,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610650, now seen corresponding path program 1 times [2024-11-19 08:57:18,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:18,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723036306] [2024-11-19 08:57:18,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:18,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:18,189 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 08:57:18,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723036306] [2024-11-19 08:57:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723036306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:18,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:18,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:18,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022496531] [2024-11-19 08:57:18,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:18,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:57:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:18,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:57:18,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:57:18,192 INFO L87 Difference]: Start difference. First operand 728 states and 874 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:18,818 INFO L93 Difference]: Finished difference Result 754 states and 927 transitions. [2024-11-19 08:57:18,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:57:18,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 08:57:18,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:18,821 INFO L225 Difference]: With dead ends: 754 [2024-11-19 08:57:18,821 INFO L226 Difference]: Without dead ends: 754 [2024-11-19 08:57:18,821 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 08:57:18,822 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 965 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:18,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 791 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 08:57:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-19 08:57:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 705. [2024-11-19 08:57:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 460 states have (on average 1.7934782608695652) internal successors, (825), 699 states have internal predecessors, (825), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 851 transitions. [2024-11-19 08:57:18,836 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 851 transitions. Word has length 11 [2024-11-19 08:57:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:18,836 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 851 transitions. [2024-11-19 08:57:18,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 851 transitions. [2024-11-19 08:57:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 08:57:18,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:18,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:18,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 08:57:18,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:18,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610649, now seen corresponding path program 1 times [2024-11-19 08:57:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:18,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770937060] [2024-11-19 08:57:18,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:18,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:18,908 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 08:57:18,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:18,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770937060] [2024-11-19 08:57:18,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770937060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:18,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:18,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:18,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817173092] [2024-11-19 08:57:18,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:18,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:18,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:18,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:18,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:18,911 INFO L87 Difference]: Start difference. First operand 705 states and 851 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:18,940 INFO L93 Difference]: Finished difference Result 630 states and 748 transitions. [2024-11-19 08:57:18,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:18,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 08:57:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:18,942 INFO L225 Difference]: With dead ends: 630 [2024-11-19 08:57:18,943 INFO L226 Difference]: Without dead ends: 630 [2024-11-19 08:57:18,943 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 08:57:18,944 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 61 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1259 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 08:57:18,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1259 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-19 08:57:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2024-11-19 08:57:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 397 states have (on average 1.818639798488665) internal successors, (722), 624 states have internal predecessors, (722), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 748 transitions. [2024-11-19 08:57:18,957 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 748 transitions. Word has length 11 [2024-11-19 08:57:18,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:18,958 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 748 transitions. [2024-11-19 08:57:18,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 748 transitions. [2024-11-19 08:57:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 08:57:18,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:18,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:18,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 08:57:18,960 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:18,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash 614478435, now seen corresponding path program 1 times [2024-11-19 08:57:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:18,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905224139] [2024-11-19 08:57:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:19,016 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 08:57:19,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:19,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905224139] [2024-11-19 08:57:19,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905224139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:19,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:19,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:57:19,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073013645] [2024-11-19 08:57:19,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:19,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:57:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:19,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:57:19,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:57:19,018 INFO L87 Difference]: Start difference. First operand 630 states and 748 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 08:57:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:19,072 INFO L93 Difference]: Finished difference Result 612 states and 723 transitions. [2024-11-19 08:57:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:57:19,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-19 08:57:19,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:19,075 INFO L225 Difference]: With dead ends: 612 [2024-11-19 08:57:19,075 INFO L226 Difference]: Without dead ends: 612 [2024-11-19 08:57:19,075 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 08:57:19,076 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 41 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1835 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 08:57:19,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1835 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-19 08:57:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2024-11-19 08:57:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 383 states have (on average 1.8120104438642297) internal successors, (694), 603 states have internal predecessors, (694), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 720 transitions. [2024-11-19 08:57:19,088 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 720 transitions. Word has length 13 [2024-11-19 08:57:19,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:19,088 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 720 transitions. [2024-11-19 08:57:19,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 08:57:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 720 transitions. [2024-11-19 08:57:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 08:57:19,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:19,089 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] [2024-11-19 08:57:19,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 08:57:19,089 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:19,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash 530126353, now seen corresponding path program 1 times [2024-11-19 08:57:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:19,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032615813] [2024-11-19 08:57:19,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:19,198 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 08:57:19,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:19,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032615813] [2024-11-19 08:57:19,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032615813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:19,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:19,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:19,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34912458] [2024-11-19 08:57:19,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:19,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:57:19,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:19,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:57:19,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:57:19,201 INFO L87 Difference]: Start difference. First operand 609 states and 720 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:19,705 INFO L93 Difference]: Finished difference Result 702 states and 807 transitions. [2024-11-19 08:57:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:57:19,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 08:57:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:19,707 INFO L225 Difference]: With dead ends: 702 [2024-11-19 08:57:19,708 INFO L226 Difference]: Without dead ends: 702 [2024-11-19 08:57:19,708 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 08:57:19,708 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 417 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:19,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1136 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 08:57:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2024-11-19 08:57:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 605. [2024-11-19 08:57:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 383 states have (on average 1.8015665796344646) internal successors, (690), 599 states have internal predecessors, (690), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 716 transitions. [2024-11-19 08:57:19,721 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 716 transitions. Word has length 27 [2024-11-19 08:57:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:19,721 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 716 transitions. [2024-11-19 08:57:19,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 716 transitions. [2024-11-19 08:57:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 08:57:19,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:19,724 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] [2024-11-19 08:57:19,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 08:57:19,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:19,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:19,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1653190907, now seen corresponding path program 1 times [2024-11-19 08:57:19,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:19,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695481348] [2024-11-19 08:57:19,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:19,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:19,834 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 08:57:19,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:19,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695481348] [2024-11-19 08:57:19,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695481348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:19,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:19,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:57:19,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802114367] [2024-11-19 08:57:19,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:19,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:57:19,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:19,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:57:19,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:57:19,836 INFO L87 Difference]: Start difference. First operand 605 states and 716 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 08:57:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:19,891 INFO L93 Difference]: Finished difference Result 605 states and 712 transitions. [2024-11-19 08:57:19,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:57:19,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-11-19 08:57:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:19,894 INFO L225 Difference]: With dead ends: 605 [2024-11-19 08:57:19,894 INFO L226 Difference]: Without dead ends: 605 [2024-11-19 08:57:19,894 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 08:57:19,895 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 21 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1817 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 08:57:19,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1817 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-19 08:57:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2024-11-19 08:57:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 383 states have (on average 1.7911227154046998) internal successors, (686), 599 states have internal predecessors, (686), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 712 transitions. [2024-11-19 08:57:19,906 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 712 transitions. Word has length 61 [2024-11-19 08:57:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:19,907 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 712 transitions. [2024-11-19 08:57:19,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 08:57:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 712 transitions. [2024-11-19 08:57:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 08:57:19,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:19,908 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] [2024-11-19 08:57:19,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 08:57:19,911 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:19,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:19,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1854806959, now seen corresponding path program 1 times [2024-11-19 08:57:19,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:19,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554339584] [2024-11-19 08:57:19,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:19,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:20,051 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 08:57:20,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:20,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554339584] [2024-11-19 08:57:20,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554339584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:20,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:20,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:20,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595303201] [2024-11-19 08:57:20,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:20,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:20,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:20,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:20,052 INFO L87 Difference]: Start difference. First operand 605 states and 712 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:20,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:20,111 INFO L93 Difference]: Finished difference Result 697 states and 831 transitions. [2024-11-19 08:57:20,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:20,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-19 08:57:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:20,116 INFO L225 Difference]: With dead ends: 697 [2024-11-19 08:57:20,117 INFO L226 Difference]: Without dead ends: 697 [2024-11-19 08:57:20,117 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 08:57:20,117 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 54 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:20,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1234 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:57:20,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-19 08:57:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2024-11-19 08:57:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 475 states have (on average 1.694736842105263) internal successors, (805), 691 states have internal predecessors, (805), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 831 transitions. [2024-11-19 08:57:20,141 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 831 transitions. Word has length 69 [2024-11-19 08:57:20,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:20,141 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 831 transitions. [2024-11-19 08:57:20,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 831 transitions. [2024-11-19 08:57:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 08:57:20,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:20,142 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] [2024-11-19 08:57:20,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 08:57:20,142 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:20,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1907003630, now seen corresponding path program 1 times [2024-11-19 08:57:20,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:20,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628105943] [2024-11-19 08:57:20,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:20,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:20,524 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 08:57:20,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:20,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628105943] [2024-11-19 08:57:20,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628105943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:20,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:20,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 08:57:20,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958148832] [2024-11-19 08:57:20,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:20,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 08:57:20,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:20,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 08:57:20,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:57:20,526 INFO L87 Difference]: Start difference. First operand 697 states and 831 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 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 08:57:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:21,342 INFO L93 Difference]: Finished difference Result 659 states and 793 transitions. [2024-11-19 08:57:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:57:21,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 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 72 [2024-11-19 08:57:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:21,345 INFO L225 Difference]: With dead ends: 659 [2024-11-19 08:57:21,345 INFO L226 Difference]: Without dead ends: 659 [2024-11-19 08:57:21,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:57:21,346 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 914 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:21,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 782 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 08:57:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-19 08:57:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 619. [2024-11-19 08:57:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 435 states have (on average 1.5816091954022988) internal successors, (688), 613 states have internal predecessors, (688), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 714 transitions. [2024-11-19 08:57:21,359 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 714 transitions. Word has length 72 [2024-11-19 08:57:21,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:21,360 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 714 transitions. [2024-11-19 08:57:21,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 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 08:57:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 714 transitions. [2024-11-19 08:57:21,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 08:57:21,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:21,362 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] [2024-11-19 08:57:21,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 08:57:21,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:21,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:21,363 INFO L85 PathProgramCache]: Analyzing trace with hash -954300764, now seen corresponding path program 1 times [2024-11-19 08:57:21,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:21,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871013645] [2024-11-19 08:57:21,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:21,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:21,575 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 08:57:21,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:21,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871013645] [2024-11-19 08:57:21,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871013645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:21,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:57:21,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675189030] [2024-11-19 08:57:21,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:21,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 08:57:21,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:21,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 08:57:21,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:57:21,579 INFO L87 Difference]: Start difference. First operand 619 states and 714 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:21,999 INFO L93 Difference]: Finished difference Result 618 states and 713 transitions. [2024-11-19 08:57:22,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:57:22,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-19 08:57:22,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:22,003 INFO L225 Difference]: With dead ends: 618 [2024-11-19 08:57:22,003 INFO L226 Difference]: Without dead ends: 618 [2024-11-19 08:57:22,003 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 08:57:22,003 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 2 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:22,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1669 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 08:57:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-19 08:57:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2024-11-19 08:57:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 435 states have (on average 1.5793103448275863) internal successors, (687), 612 states have internal predecessors, (687), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 713 transitions. [2024-11-19 08:57:22,011 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 713 transitions. Word has length 77 [2024-11-19 08:57:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:22,012 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 713 transitions. [2024-11-19 08:57:22,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:22,012 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 713 transitions. [2024-11-19 08:57:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 08:57:22,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:22,013 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] [2024-11-19 08:57:22,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 08:57:22,013 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:22,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:22,013 INFO L85 PathProgramCache]: Analyzing trace with hash -954300763, now seen corresponding path program 1 times [2024-11-19 08:57:22,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:22,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872292998] [2024-11-19 08:57:22,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:22,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:22,389 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 08:57:22,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:22,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872292998] [2024-11-19 08:57:22,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872292998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:22,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:22,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:57:22,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786089645] [2024-11-19 08:57:22,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:22,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 08:57:22,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:22,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 08:57:22,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:57:22,391 INFO L87 Difference]: Start difference. First operand 618 states and 713 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:23,368 INFO L93 Difference]: Finished difference Result 617 states and 712 transitions. [2024-11-19 08:57:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:57:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-19 08:57:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:23,370 INFO L225 Difference]: With dead ends: 617 [2024-11-19 08:57:23,370 INFO L226 Difference]: Without dead ends: 617 [2024-11-19 08:57:23,370 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 08:57:23,370 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:23,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1676 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 08:57:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-19 08:57:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2024-11-19 08:57:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 434 states have (on average 1.5806451612903225) internal successors, (686), 611 states have internal predecessors, (686), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 712 transitions. [2024-11-19 08:57:23,380 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 712 transitions. Word has length 77 [2024-11-19 08:57:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:23,380 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 712 transitions. [2024-11-19 08:57:23,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 712 transitions. [2024-11-19 08:57:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 08:57:23,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:23,381 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] [2024-11-19 08:57:23,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 08:57:23,381 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:23,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1675418123, now seen corresponding path program 1 times [2024-11-19 08:57:23,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:23,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271931429] [2024-11-19 08:57:23,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:23,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:23,615 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 08:57:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:23,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271931429] [2024-11-19 08:57:23,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271931429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:23,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:23,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 08:57:23,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637509407] [2024-11-19 08:57:23,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:23,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 08:57:23,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:23,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 08:57:23,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 08:57:23,617 INFO L87 Difference]: Start difference. First operand 617 states and 712 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 08:57:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:24,351 INFO L93 Difference]: Finished difference Result 629 states and 727 transitions. [2024-11-19 08:57:24,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 08:57:24,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2024-11-19 08:57:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:24,354 INFO L225 Difference]: With dead ends: 629 [2024-11-19 08:57:24,354 INFO L226 Difference]: Without dead ends: 629 [2024-11-19 08:57:24,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 08:57:24,355 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 12 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:24,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2164 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 08:57:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-19 08:57:24,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 623. [2024-11-19 08:57:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 439 states have (on average 1.5785876993166288) internal successors, (693), 616 states have internal predecessors, (693), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-19 08:57:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 722 transitions. [2024-11-19 08:57:24,363 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 722 transitions. Word has length 85 [2024-11-19 08:57:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:24,363 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 722 transitions. [2024-11-19 08:57:24,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 08:57:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 722 transitions. [2024-11-19 08:57:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 08:57:24,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:24,364 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] [2024-11-19 08:57:24,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 08:57:24,365 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:24,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:24,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1675418124, now seen corresponding path program 1 times [2024-11-19 08:57:24,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:24,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110798771] [2024-11-19 08:57:24,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:24,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:24,808 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 08:57:24,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:24,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110798771] [2024-11-19 08:57:24,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110798771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:24,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:24,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 08:57:24,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024970838] [2024-11-19 08:57:24,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:24,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 08:57:24,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:24,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 08:57:24,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:57:24,811 INFO L87 Difference]: Start difference. First operand 623 states and 722 transitions. Second operand has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 08:57:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:25,367 INFO L93 Difference]: Finished difference Result 623 states and 721 transitions. [2024-11-19 08:57:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:57:25,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2024-11-19 08:57:25,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:25,369 INFO L225 Difference]: With dead ends: 623 [2024-11-19 08:57:25,369 INFO L226 Difference]: Without dead ends: 623 [2024-11-19 08:57:25,369 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 08:57:25,370 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 7 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:25,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2072 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 08:57:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-19 08:57:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2024-11-19 08:57:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 439 states have (on average 1.5763097949886105) internal successors, (692), 616 states have internal predecessors, (692), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-19 08:57:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 721 transitions. [2024-11-19 08:57:25,379 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 721 transitions. Word has length 85 [2024-11-19 08:57:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:25,379 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 721 transitions. [2024-11-19 08:57:25,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 08:57:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 721 transitions. [2024-11-19 08:57:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 08:57:25,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:25,379 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 08:57:25,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 08:57:25,380 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:25,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:25,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1642216262, now seen corresponding path program 1 times [2024-11-19 08:57:25,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:25,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404746380] [2024-11-19 08:57:25,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:25,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:25,749 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 08:57:25,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:25,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404746380] [2024-11-19 08:57:25,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404746380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:25,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914339790] [2024-11-19 08:57:25,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:25,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:25,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:25,755 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 08:57:25,759 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 08:57:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:25,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 08:57:25,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:25,978 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 08:57:26,110 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:26,110 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 08:57:26,121 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 08:57:26,184 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:26,185 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 08:57:26,214 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 08:57: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 08:57:26,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:26,260 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-19 08:57: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 08:57:26,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914339790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:26,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:26,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-19 08:57:26,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353246714] [2024-11-19 08:57:26,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:26,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 08:57:26,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:26,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 08:57:26,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=170, Unknown=5, NotChecked=0, Total=210 [2024-11-19 08:57:26,305 INFO L87 Difference]: Start difference. First operand 623 states and 721 transitions. Second operand has 14 states, 12 states have (on average 10.25) internal successors, (123), 13 states have internal predecessors, (123), 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 08:57:27,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:27,753 INFO L93 Difference]: Finished difference Result 622 states and 720 transitions. [2024-11-19 08:57:27,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 08:57:27,753 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.25) internal successors, (123), 13 states have internal predecessors, (123), 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 86 [2024-11-19 08:57:27,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:27,755 INFO L225 Difference]: With dead ends: 622 [2024-11-19 08:57:27,755 INFO L226 Difference]: Without dead ends: 622 [2024-11-19 08:57:27,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=373, Unknown=5, NotChecked=0, Total=462 [2024-11-19 08:57:27,756 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 499 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 3262 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:27,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 3262 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 08:57:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-19 08:57:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2024-11-19 08:57:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 439 states have (on average 1.5740318906605923) internal successors, (691), 615 states have internal predecessors, (691), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-19 08:57:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 720 transitions. [2024-11-19 08:57:27,764 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 720 transitions. Word has length 86 [2024-11-19 08:57:27,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:27,765 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 720 transitions. [2024-11-19 08:57:27,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.25) internal successors, (123), 13 states have internal predecessors, (123), 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 08:57:27,765 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 720 transitions. [2024-11-19 08:57:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 08:57:27,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:27,766 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 08:57:27,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 08:57:27,966 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,SelfDestructingSolverStorable14 [2024-11-19 08:57:27,968 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:27,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:27,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1642216263, now seen corresponding path program 1 times [2024-11-19 08:57:27,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:27,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553815527] [2024-11-19 08:57:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:27,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:28,751 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 08:57:28,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:28,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553815527] [2024-11-19 08:57:28,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553815527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:28,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369631259] [2024-11-19 08:57:28,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:28,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:28,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:28,754 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 08:57:28,755 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 08:57:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:28,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 08:57:28,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:28,919 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 08:57:29,086 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:29,087 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 08:57:29,099 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 08:57:29,134 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 08:57:29,140 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 08:57:29,221 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 08:57:29,225 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 08:57:29,319 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:29,319 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 08:57:29,324 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 08:57:29,359 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 08:57:29,363 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 08:57:29,378 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 08:57:29,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:29,453 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_630 (Array Int Int))) (<= 0 (+ 16 (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)))) (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (<= (+ 20 (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)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 08:57:29,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369631259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:29,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:29,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-19 08:57:29,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409314082] [2024-11-19 08:57:29,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:29,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 08:57:29,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:29,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 08:57:29,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2024-11-19 08:57:29,456 INFO L87 Difference]: Start difference. First operand 622 states and 720 transitions. Second operand has 18 states, 15 states have (on average 9.0) internal successors, (135), 18 states have internal predecessors, (135), 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 08:57:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:31,003 INFO L93 Difference]: Finished difference Result 629 states and 727 transitions. [2024-11-19 08:57:31,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 08:57:31,004 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.0) internal successors, (135), 18 states have internal predecessors, (135), 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 86 [2024-11-19 08:57:31,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:31,006 INFO L225 Difference]: With dead ends: 629 [2024-11-19 08:57:31,006 INFO L226 Difference]: Without dead ends: 629 [2024-11-19 08:57:31,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2024-11-19 08:57:31,006 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 504 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 3027 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:31,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 2849 Invalid, 3068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3027 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 08:57:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-19 08:57:31,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 620. [2024-11-19 08:57:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 438 states have (on average 1.5730593607305936) internal successors, (689), 613 states have internal predecessors, (689), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 715 transitions. [2024-11-19 08:57:31,015 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 715 transitions. Word has length 86 [2024-11-19 08:57:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:31,015 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 715 transitions. [2024-11-19 08:57:31,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.0) internal successors, (135), 18 states have internal predecessors, (135), 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 08:57:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 715 transitions. [2024-11-19 08:57:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 08:57:31,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:31,016 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] [2024-11-19 08:57:31,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 08:57:31,219 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,SelfDestructingSolverStorable15 [2024-11-19 08:57:31,220 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:31,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:31,220 INFO L85 PathProgramCache]: Analyzing trace with hash 566960249, now seen corresponding path program 1 times [2024-11-19 08:57:31,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:31,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642970251] [2024-11-19 08:57:31,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:31,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:31,721 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 08:57:31,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:31,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642970251] [2024-11-19 08:57:31,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642970251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:31,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:31,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 08:57:31,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208417802] [2024-11-19 08:57:31,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:31,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 08:57:31,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:31,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 08:57:31,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-19 08:57:31,723 INFO L87 Difference]: Start difference. First operand 620 states and 715 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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 08:57:32,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:32,718 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-19 08:57:32,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 08:57:32,719 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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 88 [2024-11-19 08:57:32,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:32,721 INFO L225 Difference]: With dead ends: 633 [2024-11-19 08:57:32,721 INFO L226 Difference]: Without dead ends: 633 [2024-11-19 08:57:32,721 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 08:57:32,721 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 506 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 2620 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:32,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 2620 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 08:57:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-19 08:57:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 629. [2024-11-19 08:57:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 446 states have (on average 1.5672645739910314) internal successors, (699), 621 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:57:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 726 transitions. [2024-11-19 08:57:32,729 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 726 transitions. Word has length 88 [2024-11-19 08:57:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:32,729 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 726 transitions. [2024-11-19 08:57:32,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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 08:57:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 726 transitions. [2024-11-19 08:57:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 08:57:32,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:32,730 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] [2024-11-19 08:57:32,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 08:57:32,730 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:32,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:32,730 INFO L85 PathProgramCache]: Analyzing trace with hash 566960250, now seen corresponding path program 1 times [2024-11-19 08:57:32,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:32,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894831410] [2024-11-19 08:57:32,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:32,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:33,203 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 08:57:33,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:33,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894831410] [2024-11-19 08:57:33,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894831410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:33,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:33,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 08:57:33,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288064704] [2024-11-19 08:57:33,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:33,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 08:57:33,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:33,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 08:57:33,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 08:57:33,205 INFO L87 Difference]: Start difference. First operand 629 states and 726 transitions. Second operand has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 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 08:57:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:34,142 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-19 08:57:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 08:57:34,142 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 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 88 [2024-11-19 08:57:34,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:34,144 INFO L225 Difference]: With dead ends: 632 [2024-11-19 08:57:34,144 INFO L226 Difference]: Without dead ends: 632 [2024-11-19 08:57:34,145 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 08:57:34,145 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 521 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:34,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1790 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 08:57:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-19 08:57:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 629. [2024-11-19 08:57:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 446 states have (on average 1.5650224215246638) internal successors, (698), 621 states have internal predecessors, (698), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:57:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 725 transitions. [2024-11-19 08:57:34,152 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 725 transitions. Word has length 88 [2024-11-19 08:57:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:34,153 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 725 transitions. [2024-11-19 08:57:34,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 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 08:57:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 725 transitions. [2024-11-19 08:57:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 08:57:34,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:34,154 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 08:57:34,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 08:57:34,154 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:34,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:34,154 INFO L85 PathProgramCache]: Analyzing trace with hash -707202722, now seen corresponding path program 1 times [2024-11-19 08:57:34,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:34,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170598250] [2024-11-19 08:57:34,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:34,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:34,573 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 08:57:34,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:34,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170598250] [2024-11-19 08:57:34,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170598250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:34,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931354693] [2024-11-19 08:57:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:34,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:34,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:34,577 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 08:57:34,582 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 08:57:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:34,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 08:57:34,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:34,746 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 08:57:34,819 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:34,820 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 08:57:34,824 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 08:57:34,866 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:34,866 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 08:57:34,901 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:34,901 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 08:57:34,911 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 08:57:34,913 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 08:57:34,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:34,943 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (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_880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-19 08:57:34,973 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-19 08:57:34,974 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 08:57:34,979 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (= (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~mem50#1.base| v_ArrVal_883))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_880)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-19 08:57:34,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931354693] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:34,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:34,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-19 08:57:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436653391] [2024-11-19 08:57:34,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:34,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 08:57:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:34,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 08:57:34,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=221, Unknown=10, NotChecked=62, Total=342 [2024-11-19 08:57:34,982 INFO L87 Difference]: Start difference. First operand 629 states and 725 transitions. Second operand has 16 states, 14 states have (on average 9.142857142857142) internal successors, (128), 15 states have internal predecessors, (128), 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 08:57:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:36,377 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-19 08:57:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 08:57:36,378 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.142857142857142) internal successors, (128), 15 states have internal predecessors, (128), 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 08:57:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:36,380 INFO L225 Difference]: With dead ends: 631 [2024-11-19 08:57:36,380 INFO L226 Difference]: Without dead ends: 631 [2024-11-19 08:57:36,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=447, Unknown=13, NotChecked=90, Total=650 [2024-11-19 08:57:36,381 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 493 mSDsluCounter, 3557 mSDsCounter, 0 mSdLazyCounter, 3097 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 3915 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:36,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3915 Invalid, 3120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3097 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 08:57:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-19 08:57:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 628. [2024-11-19 08:57:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 446 states have (on average 1.562780269058296) internal successors, (697), 620 states have internal predecessors, (697), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:57:36,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 724 transitions. [2024-11-19 08:57:36,393 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 724 transitions. Word has length 89 [2024-11-19 08:57:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:36,394 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 724 transitions. [2024-11-19 08:57:36,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.142857142857142) internal successors, (128), 15 states have internal predecessors, (128), 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 08:57:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 724 transitions. [2024-11-19 08:57:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 08:57:36,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:36,394 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 08:57:36,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 08:57:36,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:36,599 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:36,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash -707202721, now seen corresponding path program 1 times [2024-11-19 08:57:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:36,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623344939] [2024-11-19 08:57:36,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:37,549 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 08:57:37,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:37,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623344939] [2024-11-19 08:57:37,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623344939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:37,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938975706] [2024-11-19 08:57:37,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:37,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:37,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:37,551 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 08:57:37,556 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 08:57:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:37,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-19 08:57:37,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:37,716 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 08:57:37,788 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 08:57:37,794 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:37,795 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 08:57:37,814 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 08:57:37,816 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 08:57:37,875 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 08:57:37,878 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 08:57:37,956 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:37,956 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 08:57:37,959 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 08:57:38,044 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:38,045 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 08:57:38,051 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 08:57:38,062 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 08:57:38,066 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 08:57:38,081 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 08:57:38,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:38,130 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1020 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |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 08:57:38,207 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1027) (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|) .cse0) v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1021 (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 ((.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~mem50#1.base| v_ArrVal_1027) .cse1 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-19 08:57:38,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938975706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:38,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:38,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-19 08:57:38,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938767041] [2024-11-19 08:57:38,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:38,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 08:57:38,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:38,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 08:57:38,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=8, NotChecked=86, Total=600 [2024-11-19 08:57:38,211 INFO L87 Difference]: Start difference. First operand 628 states and 724 transitions. Second operand has 20 states, 17 states have (on average 8.294117647058824) internal successors, (141), 20 states have internal predecessors, (141), 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 08:57:40,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:40,218 INFO L93 Difference]: Finished difference Result 630 states and 728 transitions. [2024-11-19 08:57:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 08:57:40,219 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.294117647058824) internal successors, (141), 20 states have internal predecessors, (141), 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 89 [2024-11-19 08:57:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:40,222 INFO L225 Difference]: With dead ends: 630 [2024-11-19 08:57:40,222 INFO L226 Difference]: Without dead ends: 630 [2024-11-19 08:57:40,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=8, NotChecked=106, Total=870 [2024-11-19 08:57:40,222 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 499 mSDsluCounter, 3246 mSDsCounter, 0 mSdLazyCounter, 3965 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 3606 SdHoareTripleChecker+Invalid, 4005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:40,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 3606 Invalid, 4005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3965 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 08:57:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-19 08:57:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 618. [2024-11-19 08:57:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 438 states have (on average 1.5684931506849316) internal successors, (687), 611 states have internal predecessors, (687), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 713 transitions. [2024-11-19 08:57:40,229 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 713 transitions. Word has length 89 [2024-11-19 08:57:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:40,230 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 713 transitions. [2024-11-19 08:57:40,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.294117647058824) internal successors, (141), 20 states have internal predecessors, (141), 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 08:57:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 713 transitions. [2024-11-19 08:57:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 08:57:40,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:40,231 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] [2024-11-19 08:57:40,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 08:57:40,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:40,435 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:40,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1792985486, now seen corresponding path program 1 times [2024-11-19 08:57:40,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:40,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511622415] [2024-11-19 08:57:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:40,882 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 08:57:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:40,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511622415] [2024-11-19 08:57:40,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511622415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:40,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:40,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 08:57:40,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055324908] [2024-11-19 08:57:40,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:40,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 08:57:40,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:40,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 08:57:40,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 08:57:40,885 INFO L87 Difference]: Start difference. First operand 618 states and 713 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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 08:57:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:42,016 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-19 08:57:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 08:57:42,017 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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 91 [2024-11-19 08:57:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:42,019 INFO L225 Difference]: With dead ends: 634 [2024-11-19 08:57:42,019 INFO L226 Difference]: Without dead ends: 634 [2024-11-19 08:57:42,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-19 08:57:42,020 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 525 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 2340 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 2970 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:42,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 2970 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2340 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 08:57:42,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-19 08:57:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 630. [2024-11-19 08:57:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 449 states have (on average 1.55902004454343) internal successors, (700), 622 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:57:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 727 transitions. [2024-11-19 08:57:42,026 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 727 transitions. Word has length 91 [2024-11-19 08:57:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:42,027 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 727 transitions. [2024-11-19 08:57:42,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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 08:57:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 727 transitions. [2024-11-19 08:57:42,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 08:57:42,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:42,028 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] [2024-11-19 08:57:42,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 08:57:42,028 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:42,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1792985485, now seen corresponding path program 1 times [2024-11-19 08:57:42,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:42,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623295240] [2024-11-19 08:57:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:42,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:42,536 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 08:57:42,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:42,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623295240] [2024-11-19 08:57:42,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623295240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:42,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:42,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 08:57:42,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558228696] [2024-11-19 08:57:42,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:42,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 08:57:42,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:42,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 08:57:42,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 08:57:42,539 INFO L87 Difference]: Start difference. First operand 630 states and 727 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 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 08:57:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:43,597 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-19 08:57:43,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 08:57:43,597 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 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 91 [2024-11-19 08:57:43,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:43,599 INFO L225 Difference]: With dead ends: 633 [2024-11-19 08:57:43,599 INFO L226 Difference]: Without dead ends: 633 [2024-11-19 08:57:43,599 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 08:57:43,600 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 521 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:43,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 2047 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 08:57:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-19 08:57:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2024-11-19 08:57:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 449 states have (on average 1.556792873051225) internal successors, (699), 622 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:57:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 726 transitions. [2024-11-19 08:57:43,608 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 726 transitions. Word has length 91 [2024-11-19 08:57:43,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:43,608 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 726 transitions. [2024-11-19 08:57:43,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 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 08:57:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 726 transitions. [2024-11-19 08:57:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 08:57:43,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:43,609 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 08:57:43,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 08:57:43,610 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:43,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:43,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1461092499, now seen corresponding path program 1 times [2024-11-19 08:57:43,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:43,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239833428] [2024-11-19 08:57:43,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:43,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:44,102 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 08:57:44,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:44,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239833428] [2024-11-19 08:57:44,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239833428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:44,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867761832] [2024-11-19 08:57:44,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:44,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:44,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:44,107 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 08:57:44,108 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 08:57:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:44,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 08:57:44,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:44,308 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 08:57:44,382 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:44,383 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 08:57:44,388 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 08:57:44,424 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:44,425 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 08:57:44,459 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:44,459 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 08:57:44,492 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:44,492 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 08:57:44,500 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 08:57:44,504 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 08:57:44,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:44,591 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int)) (v_ArrVal_1300 (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_1300))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 08:57:44,622 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-19 08:57:44,622 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 08:57:44,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867761832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:44,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:44,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2024-11-19 08:57:44,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41145472] [2024-11-19 08:57:44,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:44,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 08:57:44,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 08:57:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=357, Unknown=38, NotChecked=40, Total=506 [2024-11-19 08:57:44,656 INFO L87 Difference]: Start difference. First operand 630 states and 726 transitions. Second operand has 18 states, 16 states have (on average 8.3125) internal successors, (133), 17 states have internal predecessors, (133), 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 08:57:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:46,075 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-19 08:57:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 08:57:46,075 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.3125) internal successors, (133), 17 states have internal predecessors, (133), 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 08:57:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:46,077 INFO L225 Difference]: With dead ends: 632 [2024-11-19 08:57:46,077 INFO L226 Difference]: Without dead ends: 632 [2024-11-19 08:57:46,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=688, Unknown=46, NotChecked=56, Total=930 [2024-11-19 08:57:46,078 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 495 mSDsluCounter, 3563 mSDsCounter, 0 mSdLazyCounter, 3087 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 3920 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:46,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 3920 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3087 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 08:57:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-19 08:57:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 629. [2024-11-19 08:57:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 449 states have (on average 1.55456570155902) internal successors, (698), 621 states have internal predecessors, (698), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:57:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 725 transitions. [2024-11-19 08:57:46,084 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 725 transitions. Word has length 92 [2024-11-19 08:57:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:46,085 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 725 transitions. [2024-11-19 08:57:46,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.3125) internal successors, (133), 17 states have internal predecessors, (133), 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 08:57:46,085 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 725 transitions. [2024-11-19 08:57:46,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 08:57:46,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:46,085 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 08:57:46,102 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 08:57:46,290 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,SelfDestructingSolverStorable22 [2024-11-19 08:57:46,290 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:46,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:46,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1461092498, now seen corresponding path program 1 times [2024-11-19 08:57:46,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:46,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21298744] [2024-11-19 08:57:46,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:46,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:46,935 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 08:57:46,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:46,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21298744] [2024-11-19 08:57:46,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21298744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:46,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333825810] [2024-11-19 08:57:46,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:46,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:46,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:46,937 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 08:57:46,938 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 08:57:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:47,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 08:57:47,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:47,146 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 08:57:47,234 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:47,235 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 08:57:47,240 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 08:57:47,264 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 08:57:47,266 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 08:57:47,334 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 08:57:47,337 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 08:57:47,427 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:47,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 08:57:47,432 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 08:57:47,492 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:47,492 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 08:57:47,498 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 08:57:47,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:47,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 08:57:47,560 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 41 treesize of output 22 [2024-11-19 08:57:47,602 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 08:57:47,606 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 30 treesize of output 12 [2024-11-19 08:57:47,627 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 08:57:47,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:47,803 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1454))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) (forall ((v_ArrVal_1454 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1454))) (or (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store .cse2 .cse3 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)))))) is different from false [2024-11-19 08:57:47,963 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1462))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse3 v_ArrVal_1454))) (or (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store .cse2 .cse3 v_ArrVal_1453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1462))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse8 v_ArrVal_1454))) (or (< (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1453))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-11-19 08:57:47,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333825810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:47,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:47,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2024-11-19 08:57:47,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029230105] [2024-11-19 08:57:47,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:47,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 08:57:47,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:47,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 08:57:47,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=640, Unknown=15, NotChecked=106, Total=870 [2024-11-19 08:57:47,968 INFO L87 Difference]: Start difference. First operand 629 states and 725 transitions. Second operand has 23 states, 20 states have (on average 7.35) internal successors, (147), 23 states have internal predecessors, (147), 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 08:57:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:49,934 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-19 08:57:49,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 08:57:49,935 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.35) internal successors, (147), 23 states have internal predecessors, (147), 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 92 [2024-11-19 08:57:49,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:49,937 INFO L225 Difference]: With dead ends: 631 [2024-11-19 08:57:49,937 INFO L226 Difference]: Without dead ends: 631 [2024-11-19 08:57:49,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=937, Unknown=15, NotChecked=130, Total=1260 [2024-11-19 08:57:49,938 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 497 mSDsluCounter, 3063 mSDsCounter, 0 mSdLazyCounter, 3522 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 3422 SdHoareTripleChecker+Invalid, 3549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:49,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 3422 Invalid, 3549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3522 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 08:57:49,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-19 08:57:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 616. [2024-11-19 08:57:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 438 states have (on average 1.5639269406392695) internal successors, (685), 609 states have internal predecessors, (685), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:57:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 711 transitions. [2024-11-19 08:57:49,945 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 711 transitions. Word has length 92 [2024-11-19 08:57:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:49,945 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 711 transitions. [2024-11-19 08:57:49,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.35) internal successors, (147), 23 states have internal predecessors, (147), 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 08:57:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 711 transitions. [2024-11-19 08:57:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 08:57:49,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:49,946 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] [2024-11-19 08:57:49,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 08:57:50,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:50,151 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:50,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:50,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1678265600, now seen corresponding path program 1 times [2024-11-19 08:57:50,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:50,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453399400] [2024-11-19 08:57:50,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:50,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:50,609 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 08:57:50,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:50,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453399400] [2024-11-19 08:57:50,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453399400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:50,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:50,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 08:57:50,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531930860] [2024-11-19 08:57:50,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:50,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 08:57:50,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:50,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 08:57:50,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-19 08:57:50,611 INFO L87 Difference]: Start difference. First operand 616 states and 711 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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 08:57:51,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:51,555 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-19 08:57:51,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 08:57:51,556 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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 94 [2024-11-19 08:57:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:51,557 INFO L225 Difference]: With dead ends: 635 [2024-11-19 08:57:51,558 INFO L226 Difference]: Without dead ends: 635 [2024-11-19 08:57:51,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-19 08:57:51,558 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 526 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:51,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 2939 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 08:57:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-19 08:57:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2024-11-19 08:57:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 452 states have (on average 1.5508849557522124) internal successors, (701), 623 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:57:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 728 transitions. [2024-11-19 08:57:51,567 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 728 transitions. Word has length 94 [2024-11-19 08:57:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:51,567 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 728 transitions. [2024-11-19 08:57:51,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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 08:57:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 728 transitions. [2024-11-19 08:57:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 08:57:51,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:51,569 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] [2024-11-19 08:57:51,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 08:57:51,569 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:51,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1678265601, now seen corresponding path program 1 times [2024-11-19 08:57:51,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:51,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543667863] [2024-11-19 08:57:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:51,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:52,256 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 08:57:52,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:52,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543667863] [2024-11-19 08:57:52,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543667863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:52,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:52,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 08:57:52,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544563542] [2024-11-19 08:57:52,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:52,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 08:57:52,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:52,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 08:57:52,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 08:57:52,258 INFO L87 Difference]: Start difference. First operand 631 states and 728 transitions. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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 08:57:53,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:53,389 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-19 08:57:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 08:57:53,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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 94 [2024-11-19 08:57:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:53,392 INFO L225 Difference]: With dead ends: 634 [2024-11-19 08:57:53,392 INFO L226 Difference]: Without dead ends: 634 [2024-11-19 08:57:53,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-19 08:57:53,392 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 523 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:53,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 2047 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 08:57:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-19 08:57:53,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2024-11-19 08:57:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 452 states have (on average 1.5486725663716814) internal successors, (700), 623 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:57:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 727 transitions. [2024-11-19 08:57:53,399 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 727 transitions. Word has length 94 [2024-11-19 08:57:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:53,399 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 727 transitions. [2024-11-19 08:57:53,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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 08:57:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 727 transitions. [2024-11-19 08:57:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 08:57:53,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:53,400 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 08:57:53,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 08:57:53,400 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:53,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:53,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2087525925, now seen corresponding path program 1 times [2024-11-19 08:57:53,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:53,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266132190] [2024-11-19 08:57:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:53,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:53,829 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 08:57:53,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:53,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266132190] [2024-11-19 08:57:53,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266132190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:53,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655629367] [2024-11-19 08:57:53,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:53,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:53,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:53,832 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 08:57:53,833 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 08:57:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:54,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 08:57:54,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:54,024 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 08:57:54,094 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:54,094 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 08:57:54,100 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 08:57:54,160 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:54,160 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 08:57:54,193 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:54,193 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 08:57:54,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:54,227 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 08:57:54,260 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:54,260 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 08:57:54,268 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 08:57:54,270 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 08:57:54,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:58,593 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-19 08:57:58,593 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 08:57:58,599 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1764))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-19 08:57:58,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655629367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:58,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:58,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2024-11-19 08:57:58,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936078388] [2024-11-19 08:57:58,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:58,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 08:57:58,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:58,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 08:57:58,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=549, Unknown=57, NotChecked=50, Total=756 [2024-11-19 08:57:58,602 INFO L87 Difference]: Start difference. First operand 631 states and 727 transitions. Second operand has 21 states, 19 states have (on average 7.578947368421052) internal successors, (144), 21 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:58:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:00,333 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-19 08:58:00,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 08:58:00,333 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.578947368421052) internal successors, (144), 21 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2024-11-19 08:58:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:00,335 INFO L225 Difference]: With dead ends: 633 [2024-11-19 08:58:00,335 INFO L226 Difference]: Without dead ends: 633 [2024-11-19 08:58:00,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=191, Invalid=1015, Unknown=58, NotChecked=68, Total=1332 [2024-11-19 08:58:00,336 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 495 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 3083 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 3912 SdHoareTripleChecker+Invalid, 3118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:00,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 3912 Invalid, 3118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3083 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 08:58:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-19 08:58:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2024-11-19 08:58:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 452 states have (on average 1.5464601769911503) internal successors, (699), 622 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:58:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 726 transitions. [2024-11-19 08:58:00,343 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 726 transitions. Word has length 95 [2024-11-19 08:58:00,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:00,343 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 726 transitions. [2024-11-19 08:58:00,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.578947368421052) internal successors, (144), 21 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:58:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 726 transitions. [2024-11-19 08:58:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 08:58:00,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:00,344 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 08:58:00,363 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 08:58:00,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:58:00,545 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:58:00,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2087525926, now seen corresponding path program 1 times [2024-11-19 08:58:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:00,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268072045] [2024-11-19 08:58:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:01,210 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 08:58:01,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:01,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268072045] [2024-11-19 08:58:01,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268072045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:58:01,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743442944] [2024-11-19 08:58:01,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:01,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:58:01,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:58:01,213 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 08:58:01,214 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 08:58:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:01,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-19 08:58:01,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:01,399 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 08:58:01,479 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:58:01,479 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 08:58:01,485 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 08:58:01,489 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 08:58:01,493 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 08:58:01,532 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 08:58:01,535 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 08:58:01,612 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:01,612 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 08:58:01,616 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 08:58:01,671 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:01,671 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 08:58:01,677 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 08:58:01,723 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:01,723 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 08:58:01,728 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 08:58:01,776 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:01,777 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 08:58:01,784 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 08:58:01,796 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 08:58:01,800 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 08:58:01,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 08:58:01,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:58:01,856 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_1930 (Array Int Int)) (v_ArrVal_1929 (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_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 08:58:01,864 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_1930 (Array Int Int)) (v_ArrVal_1929 (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_1930) |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 08:58:01,879 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927))) (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_1928) .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1928) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) |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 08:58:01,945 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_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1926))) (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_1925) .cse0 v_ArrVal_1928) (select (select (store .cse1 .cse0 v_ArrVal_1927) |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_1930 (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))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1926))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1927))) (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_1925) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-19 08:58:02,107 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1930 (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_1936 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1936))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1927))) (let ((.cse2 (select (select .cse4 |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) .cse0 v_ArrVal_1925) .cse1 v_ArrVal_1928) .cse2 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (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_1936 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1936))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1926))) (let ((.cse8 (select (select .cse9 |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) .cse7 v_ArrVal_1925) .cse8 v_ArrVal_1928) (select (select (store .cse9 .cse8 v_ArrVal_1927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-19 08:58:02,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743442944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:58:02,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:58:02,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2024-11-19 08:58:02,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679438912] [2024-11-19 08:58:02,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:58:02,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 08:58:02,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 08:58:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=452, Unknown=17, NotChecked=240, Total=812 [2024-11-19 08:58:02,111 INFO L87 Difference]: Start difference. First operand 630 states and 726 transitions. Second operand has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 20 states have internal predecessors, (143), 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 08:58:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:03,550 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-19 08:58:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 08:58:03,550 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 20 states have internal predecessors, (143), 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 95 [2024-11-19 08:58:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:03,552 INFO L225 Difference]: With dead ends: 632 [2024-11-19 08:58:03,552 INFO L226 Difference]: Without dead ends: 632 [2024-11-19 08:58:03,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=763, Unknown=18, NotChecked=310, Total=1260 [2024-11-19 08:58:03,553 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 496 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 2119 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:03,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 2052 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2119 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 08:58:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-19 08:58:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 614. [2024-11-19 08:58:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 438 states have (on average 1.5593607305936072) internal successors, (683), 607 states have internal predecessors, (683), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 709 transitions. [2024-11-19 08:58:03,559 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 709 transitions. Word has length 95 [2024-11-19 08:58:03,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:03,559 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 709 transitions. [2024-11-19 08:58:03,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 20 states have internal predecessors, (143), 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 08:58:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 709 transitions. [2024-11-19 08:58:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 08:58:03,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:03,560 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] [2024-11-19 08:58:03,575 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 08:58:03,764 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,SelfDestructingSolverStorable27 [2024-11-19 08:58:03,765 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:58:03,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:03,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1581366978, now seen corresponding path program 1 times [2024-11-19 08:58:03,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:03,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347372783] [2024-11-19 08:58:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:03,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:04,376 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 08:58:04,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:04,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347372783] [2024-11-19 08:58:04,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347372783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:04,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:04,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 08:58:04,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597174854] [2024-11-19 08:58:04,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:04,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 08:58:04,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:04,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 08:58:04,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-19 08:58:04,378 INFO L87 Difference]: Start difference. First operand 614 states and 709 transitions. Second operand has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 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 08:58:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:05,991 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-19 08:58:05,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 08:58:05,992 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 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 98 [2024-11-19 08:58:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:05,994 INFO L225 Difference]: With dead ends: 637 [2024-11-19 08:58:05,994 INFO L226 Difference]: Without dead ends: 637 [2024-11-19 08:58:05,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2024-11-19 08:58:05,994 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 507 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 2873 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 3594 SdHoareTripleChecker+Invalid, 2898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:05,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 3594 Invalid, 2898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2873 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 08:58:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-19 08:58:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2024-11-19 08:58:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 456 states have (on average 1.5416666666666667) internal successors, (703), 625 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:58:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 730 transitions. [2024-11-19 08:58:06,003 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 730 transitions. Word has length 98 [2024-11-19 08:58:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:06,003 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 730 transitions. [2024-11-19 08:58:06,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 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 08:58:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 730 transitions. [2024-11-19 08:58:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 08:58:06,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:06,004 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] [2024-11-19 08:58:06,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 08:58:06,004 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:58:06,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:06,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1581366979, now seen corresponding path program 1 times [2024-11-19 08:58:06,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:06,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250299703] [2024-11-19 08:58:06,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:06,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:06,847 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 08:58:06,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:06,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250299703] [2024-11-19 08:58:06,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250299703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:06,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:06,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-19 08:58:06,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171550160] [2024-11-19 08:58:06,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:06,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 08:58:06,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:06,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 08:58:06,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-19 08:58:06,849 INFO L87 Difference]: Start difference. First operand 633 states and 730 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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 08:58:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:08,441 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-19 08:58:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 08:58:08,442 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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 98 [2024-11-19 08:58:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:08,443 INFO L225 Difference]: With dead ends: 636 [2024-11-19 08:58:08,443 INFO L226 Difference]: Without dead ends: 636 [2024-11-19 08:58:08,444 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 08:58:08,444 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 528 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:08,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 2431 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 08:58:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-19 08:58:08,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2024-11-19 08:58:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 456 states have (on average 1.5394736842105263) internal successors, (702), 625 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:58:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 729 transitions. [2024-11-19 08:58:08,454 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 729 transitions. Word has length 98 [2024-11-19 08:58:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:08,454 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 729 transitions. [2024-11-19 08:58:08,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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 08:58:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 729 transitions. [2024-11-19 08:58:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 08:58:08,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:08,455 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 08:58:08,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 08:58:08,455 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:58:08,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:08,455 INFO L85 PathProgramCache]: Analyzing trace with hash 668956007, now seen corresponding path program 1 times [2024-11-19 08:58:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:08,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115149616] [2024-11-19 08:58:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:08,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:09,320 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 08:58:09,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:09,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115149616] [2024-11-19 08:58:09,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115149616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:58:09,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048027791] [2024-11-19 08:58:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:09,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:58:09,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:58:09,322 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 08:58:09,326 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 08:58:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:09,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-19 08:58:09,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:09,529 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 08:58:09,607 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:58:09,607 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 08:58:09,612 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 08:58:09,678 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:09,678 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 08:58:09,723 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:09,723 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 08:58:09,764 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:09,765 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 08:58:09,805 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:09,805 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 08:58:09,846 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:09,846 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 08:58:09,855 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 08:58:09,872 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 08:58:09,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 08:58:09,875 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 08:58:09,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:58:10,415 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-19 08:58:10,415 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 597 treesize of output 794 [2024-11-19 08:58:10,437 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2272))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2265)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2266)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2267)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-19 08:58:10,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048027791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:58:10,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:58:10,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 22 [2024-11-19 08:58:10,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439074911] [2024-11-19 08:58:10,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:58:10,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 08:58:10,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:10,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 08:58:10,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=870, Unknown=44, NotChecked=62, Total=1122 [2024-11-19 08:58:10,441 INFO L87 Difference]: Start difference. First operand 633 states and 729 transitions. Second operand has 23 states, 21 states have (on average 7.142857142857143) internal successors, (150), 23 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:58:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:11,942 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-19 08:58:11,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 08:58:11,943 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 7.142857142857143) internal successors, (150), 23 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2024-11-19 08:58:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:11,945 INFO L225 Difference]: With dead ends: 635 [2024-11-19 08:58:11,945 INFO L226 Difference]: Without dead ends: 635 [2024-11-19 08:58:11,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=1500, Unknown=44, NotChecked=82, Total=1892 [2024-11-19 08:58:11,946 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 498 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 2615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:11,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 3259 Invalid, 2615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 08:58:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-19 08:58:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2024-11-19 08:58:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 456 states have (on average 1.537280701754386) internal successors, (701), 624 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:58:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 728 transitions. [2024-11-19 08:58:11,956 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 728 transitions. Word has length 99 [2024-11-19 08:58:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:11,957 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 728 transitions. [2024-11-19 08:58:11,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 7.142857142857143) internal successors, (150), 23 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:58:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 728 transitions. [2024-11-19 08:58:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 08:58:11,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:11,958 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 08:58:11,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 08:58:12,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:58:12,159 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:58:12,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash 668956008, now seen corresponding path program 1 times [2024-11-19 08:58:12,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:12,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404051718] [2024-11-19 08:58:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:13,157 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 08:58:13,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:13,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404051718] [2024-11-19 08:58:13,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404051718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:58:13,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062734871] [2024-11-19 08:58:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:13,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:58:13,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:58:13,161 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:58:13,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 08:58:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:13,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-19 08:58:13,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:13,405 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 08:58:13,494 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:58:13,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 08:58:13,503 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 08:58:13,528 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 08:58:13,532 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 08:58:13,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 08:58:13,608 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 08:58:13,738 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:13,739 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 08:58:13,746 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 08:58:13,853 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:13,854 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 08:58:13,857 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 08:58:13,934 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:13,934 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 08:58:13,938 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 08:58:14,011 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:14,012 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 08:58:14,015 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 08:58:14,089 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:14,089 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 08:58:14,092 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 08:58:14,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-19 08:58:14,117 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 08:58:14,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:58:14,165 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-19 08:58:14,165 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 08:58:14,172 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:58:14,172 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 08:58:14,196 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 08:58:14,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:58:14,524 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_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2454) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)))) (forall ((v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2453 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2457 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2453))) (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_2454) .cse1 v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2457) (select (select (store .cse2 .cse1 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-19 08:58:15,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2450))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2451))) (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_2449) .cse0 v_ArrVal_2452) .cse1 v_ArrVal_2454) (select (select (store .cse2 .cse1 v_ArrVal_2453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2456))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2457 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2450))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2451))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2453))) (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_2449) .cse5 v_ArrVal_2452) .cse6 v_ArrVal_2454) .cse7 v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2457) (select (select (store .cse8 .cse7 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-19 08:58:29,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 08:58:29,610 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 08:58:30,442 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2462))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2450))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2451))) (let ((.cse2 (select (select .cse3 |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_2463) .cse0 v_ArrVal_2449) .cse1 v_ArrVal_2452) .cse2 v_ArrVal_2454) (select (select (store .cse3 .cse2 v_ArrVal_2453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2456))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_prenex_24 Int)) (or (forall ((v_prenex_21 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2457 Int) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_28))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_prenex_30))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_prenex_29))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_prenex_25))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_26) .cse7 v_prenex_21) .cse8 v_prenex_27) .cse9 v_prenex_23) .cse10 v_prenex_22) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| v_prenex_24 v_ArrVal_2457) (select (select (store .cse11 .cse10 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_24))))) is different from false [2024-11-19 08:58:30,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062734871] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:58:30,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:58:30,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-19 08:58:30,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084853139] [2024-11-19 08:58:30,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:58:30,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 08:58:30,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:30,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 08:58:30,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1424, Unknown=35, NotChecked=240, Total=1892 [2024-11-19 08:58:30,461 INFO L87 Difference]: Start difference. First operand 632 states and 728 transitions. Second operand has 32 states, 29 states have (on average 5.551724137931035) internal successors, (161), 30 states have internal predecessors, (161), 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)