./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:08:48,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:08:48,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:08:48,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:08:48,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:08:48,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:08:48,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:08:48,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:08:48,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:08:48,843 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:08:48,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:08:48,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:08:48,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:08:48,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:08:48,847 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:08:48,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:08:48,847 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:08:48,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:08:48,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:08:48,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:08:48,848 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:08:48,852 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:08:48,853 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:08:48,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:08:48,853 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:08:48,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:08:48,853 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:08:48,854 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:08:48,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:08:48,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:08:48,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:08:48,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:08:48,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:08:48,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:08:48,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:08:48,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:08:48,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:08:48,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:08:48,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:08:48,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:08:48,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:08:48,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:08:48,858 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 -> 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 [2024-11-19 09:08:49,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:08:49,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:08:49,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:08:49,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:08:49,191 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:08:49,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2024-11-19 09:08:50,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:08:50,980 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:08:50,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2024-11-19 09:08:51,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f06f438/eff68211473342edb61b59b78623c6d6/FLAGa078a08c0 [2024-11-19 09:08:51,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42f06f438/eff68211473342edb61b59b78623c6d6 [2024-11-19 09:08:51,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:08:51,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:08:51,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:08:51,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:08:51,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:08:51,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:51,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3510e155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51, skipping insertion in model container [2024-11-19 09:08:51,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:51,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:08:51,528 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:08:51,565 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:08:51,571 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:08:51,578 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:08:51,587 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:08:51,632 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:08:51,634 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:08:51,639 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:08:51,646 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:08:51,661 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:08:51,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:08:51,686 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:08:51,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:08:51,820 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:08:51,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51 WrapperNode [2024-11-19 09:08:51,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:08:51,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:08:51,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:08:51,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:08:51,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:51,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:51,948 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1603 [2024-11-19 09:08:51,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:08:51,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:08:51,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:08:51,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:08:51,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:51,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:51,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:52,101 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-19 09:08:52,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:52,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:52,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:52,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:52,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:52,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:52,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:08:52,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:08:52,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:08:52,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:08:52,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51" (1/1) ... [2024-11-19 09:08:52,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:08:52,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:08:52,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:08:52,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:08:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:08:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:08:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 09:08:52,397 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 09:08:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:08:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:08:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 09:08:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 09:08:52,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 09:08:52,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 09:08:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:08:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:08:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:08:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:08:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:08:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:08:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:08:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:08:52,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:08:52,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:08:52,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:08:52,641 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:08:52,642 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:08:52,645 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:08:52,684 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:08:55,163 INFO L? ?]: Removed 1502 outVars from TransFormulas that were not future-live. [2024-11-19 09:08:55,164 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:08:55,209 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:08:55,210 INFO L316 CfgBuilder]: Removed 60 assume(true) statements. [2024-11-19 09:08:55,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:08:55 BoogieIcfgContainer [2024-11-19 09:08:55,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:08:55,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:08:55,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:08:55,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:08:55,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:08:51" (1/3) ... [2024-11-19 09:08:55,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a3aedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:08:55, skipping insertion in model container [2024-11-19 09:08:55,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:08:51" (2/3) ... [2024-11-19 09:08:55,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a3aedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:08:55, skipping insertion in model container [2024-11-19 09:08:55,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:08:55" (3/3) ... [2024-11-19 09:08:55,222 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-1.i [2024-11-19 09:08:55,239 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:08:55,240 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-19 09:08:55,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:08:55,341 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;@1cdd35ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:08:55,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-19 09:08:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 1452 states, 811 states have (on average 2.0752157829839706) internal successors, (1683), 1443 states have internal predecessors, (1683), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:08:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 09:08:55,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:08:55,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:08:55,358 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:08:55,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:08:55,364 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-19 09:08:55,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:08:55,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804539450] [2024-11-19 09:08:55,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:08:55,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:08:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:08:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:08:55,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:08:55,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804539450] [2024-11-19 09:08:55,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804539450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:08:55,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:08:55,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:08:55,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380521024] [2024-11-19 09:08:55,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:08:55,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:08:55,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:08:55,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:08:55,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:08:55,684 INFO L87 Difference]: Start difference. First operand has 1452 states, 811 states have (on average 2.0752157829839706) internal successors, (1683), 1443 states have internal predecessors, (1683), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) 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 09:08:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:08:56,705 INFO L93 Difference]: Finished difference Result 1341 states and 1536 transitions. [2024-11-19 09:08:56,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:08:56,708 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 09:08:56,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:08:56,729 INFO L225 Difference]: With dead ends: 1341 [2024-11-19 09:08:56,729 INFO L226 Difference]: Without dead ends: 1339 [2024-11-19 09:08:56,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:08:56,734 INFO L432 NwaCegarLoop]: 922 mSDtfsCounter, 1366 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:08:56,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 935 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 09:08:56,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2024-11-19 09:08:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2024-11-19 09:08:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 801 states have (on average 1.8714107365792758) internal successors, (1499), 1328 states have internal predecessors, (1499), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:08:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1531 transitions. [2024-11-19 09:08:56,830 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1531 transitions. Word has length 5 [2024-11-19 09:08:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:08:56,831 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1531 transitions. [2024-11-19 09:08:56,831 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 09:08:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1531 transitions. [2024-11-19 09:08:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 09:08:56,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:08:56,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:08:56,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:08:56,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:08:56,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:08:56,833 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-19 09:08:56,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:08:56,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673378519] [2024-11-19 09:08:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:08:56,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:08:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:08:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:08:56,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:08:56,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673378519] [2024-11-19 09:08:56,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673378519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:08:56,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:08:56,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:08:56,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273943398] [2024-11-19 09:08:56,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:08:56,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:08:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:08:56,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:08:56,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:08:56,957 INFO L87 Difference]: Start difference. First operand 1337 states and 1531 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 09:08:57,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:08:57,976 INFO L93 Difference]: Finished difference Result 1753 states and 2025 transitions. [2024-11-19 09:08:57,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:08:57,976 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 09:08:57,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:08:57,985 INFO L225 Difference]: With dead ends: 1753 [2024-11-19 09:08:57,985 INFO L226 Difference]: Without dead ends: 1753 [2024-11-19 09:08:57,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:08:57,987 INFO L432 NwaCegarLoop]: 1286 mSDtfsCounter, 820 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:08:57,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1947 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 09:08:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2024-11-19 09:08:58,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1600. [2024-11-19 09:08:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1074 states have (on average 1.8370577281191807) internal successors, (1973), 1591 states have internal predecessors, (1973), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:08:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2005 transitions. [2024-11-19 09:08:58,041 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2005 transitions. Word has length 5 [2024-11-19 09:08:58,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:08:58,041 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2005 transitions. [2024-11-19 09:08:58,041 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 09:08:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2005 transitions. [2024-11-19 09:08:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 09:08:58,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:08:58,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:08:58,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:08:58,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:08:58,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:08:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1424554157, now seen corresponding path program 1 times [2024-11-19 09:08:58,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:08:58,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464371242] [2024-11-19 09:08:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:08:58,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:08:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:08:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:08:58,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:08:58,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464371242] [2024-11-19 09:08:58,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464371242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:08:58,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:08:58,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:08:58,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254899610] [2024-11-19 09:08:58,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:08:58,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:08:58,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:08:58,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:08:58,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:08:58,083 INFO L87 Difference]: Start difference. First operand 1600 states and 2005 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 09:08:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:08:58,139 INFO L93 Difference]: Finished difference Result 3150 states and 3940 transitions. [2024-11-19 09:08:58,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:08:58,140 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 09:08:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:08:58,155 INFO L225 Difference]: With dead ends: 3150 [2024-11-19 09:08:58,155 INFO L226 Difference]: Without dead ends: 3150 [2024-11-19 09:08:58,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:08:58,158 INFO L432 NwaCegarLoop]: 2030 mSDtfsCounter, 1438 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 3546 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 09:08:58,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 3546 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:08:58,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2024-11-19 09:08:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 1601. [2024-11-19 09:08:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1075 states have (on average 1.8362790697674418) internal successors, (1974), 1592 states have internal predecessors, (1974), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:08:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2006 transitions. [2024-11-19 09:08:58,230 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2006 transitions. Word has length 6 [2024-11-19 09:08:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:08:58,230 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2006 transitions. [2024-11-19 09:08:58,231 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 09:08:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2006 transitions. [2024-11-19 09:08:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 09:08:58,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:08:58,231 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:08:58,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:08:58,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:08:58,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:08:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610650, now seen corresponding path program 1 times [2024-11-19 09:08:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:08:58,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329123340] [2024-11-19 09:08:58,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:08:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:08:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:08:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:08:58,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:08:58,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329123340] [2024-11-19 09:08:58,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329123340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:08:58,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:08:58,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:08:58,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420131778] [2024-11-19 09:08:58,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:08:58,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:08:58,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:08:58,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:08:58,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:08:58,322 INFO L87 Difference]: Start difference. First operand 1601 states and 2006 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 09:08:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:08:59,423 INFO L93 Difference]: Finished difference Result 1627 states and 2059 transitions. [2024-11-19 09:08:59,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:08:59,423 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 09:08:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:08:59,430 INFO L225 Difference]: With dead ends: 1627 [2024-11-19 09:08:59,430 INFO L226 Difference]: Without dead ends: 1627 [2024-11-19 09:08:59,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:08:59,432 INFO L432 NwaCegarLoop]: 894 mSDtfsCounter, 1634 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:08:59,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1650 Valid, 1633 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 09:08:59,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-11-19 09:08:59,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1578. [2024-11-19 09:08:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1075 states have (on average 1.8148837209302326) internal successors, (1951), 1569 states have internal predecessors, (1951), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:08:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 1983 transitions. [2024-11-19 09:08:59,463 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 1983 transitions. Word has length 11 [2024-11-19 09:08:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:08:59,463 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 1983 transitions. [2024-11-19 09:08:59,464 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 09:08:59,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1983 transitions. [2024-11-19 09:08:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 09:08:59,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:08:59,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:08:59,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:08:59,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:08:59,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:08:59,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610649, now seen corresponding path program 1 times [2024-11-19 09:08:59,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:08:59,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303770907] [2024-11-19 09:08:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:08:59,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:08:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:08:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:08:59,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:08:59,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303770907] [2024-11-19 09:08:59,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303770907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:08:59,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:08:59,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:08:59,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322416042] [2024-11-19 09:08:59,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:08:59,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:08:59,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:08:59,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:08:59,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:08:59,550 INFO L87 Difference]: Start difference. First operand 1578 states and 1983 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 09:08:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:08:59,587 INFO L93 Difference]: Finished difference Result 1503 states and 1880 transitions. [2024-11-19 09:08:59,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:08:59,588 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 09:08:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:08:59,593 INFO L225 Difference]: With dead ends: 1503 [2024-11-19 09:08:59,593 INFO L226 Difference]: Without dead ends: 1503 [2024-11-19 09:08:59,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:08:59,594 INFO L432 NwaCegarLoop]: 1383 mSDtfsCounter, 61 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:08:59,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2713 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:08:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2024-11-19 09:08:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2024-11-19 09:08:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1012 states have (on average 1.826086956521739) internal successors, (1848), 1494 states have internal predecessors, (1848), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:08:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1880 transitions. [2024-11-19 09:08:59,631 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1880 transitions. Word has length 11 [2024-11-19 09:08:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:08:59,631 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1880 transitions. [2024-11-19 09:08:59,632 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 09:08:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1880 transitions. [2024-11-19 09:08:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 09:08:59,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:08:59,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:08:59,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:08:59,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:08:59,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:08:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash 614478435, now seen corresponding path program 1 times [2024-11-19 09:08:59,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:08:59,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792093380] [2024-11-19 09:08:59,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:08:59,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:08:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:08:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:08:59,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:08:59,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792093380] [2024-11-19 09:08:59,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792093380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:08:59,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:08:59,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:08:59,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062751274] [2024-11-19 09:08:59,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:08:59,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:08:59,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:08:59,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:08:59,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:08:59,703 INFO L87 Difference]: Start difference. First operand 1503 states and 1880 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 09:08:59,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:08:59,762 INFO L93 Difference]: Finished difference Result 1485 states and 1855 transitions. [2024-11-19 09:08:59,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:08:59,763 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 09:08:59,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:08:59,769 INFO L225 Difference]: With dead ends: 1485 [2024-11-19 09:08:59,770 INFO L226 Difference]: Without dead ends: 1485 [2024-11-19 09:08:59,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:08:59,771 INFO L432 NwaCegarLoop]: 1348 mSDtfsCounter, 41 mSDsluCounter, 2668 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4016 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:08:59,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4016 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:08:59,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2024-11-19 09:08:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1482. [2024-11-19 09:08:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 998 states have (on average 1.8236472945891784) internal successors, (1820), 1473 states have internal predecessors, (1820), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:08:59,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1852 transitions. [2024-11-19 09:08:59,801 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1852 transitions. Word has length 13 [2024-11-19 09:08:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:08:59,802 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1852 transitions. [2024-11-19 09:08:59,802 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 09:08:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1852 transitions. [2024-11-19 09:08:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 09:08:59,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:08:59,804 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 09:08:59,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:08:59,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:08:59,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:08:59,805 INFO L85 PathProgramCache]: Analyzing trace with hash 530126353, now seen corresponding path program 1 times [2024-11-19 09:08:59,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:08:59,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276788224] [2024-11-19 09:08:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:08:59,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:08:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:08:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:08:59,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:08:59,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276788224] [2024-11-19 09:08:59,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276788224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:08:59,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:08:59,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:08:59,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493069207] [2024-11-19 09:08:59,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:08:59,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:08:59,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:08:59,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:08:59,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:08:59,965 INFO L87 Difference]: Start difference. First operand 1482 states and 1852 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 09:09:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:01,123 INFO L93 Difference]: Finished difference Result 1680 states and 1944 transitions. [2024-11-19 09:09:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:09:01,123 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 09:09:01,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:01,130 INFO L225 Difference]: With dead ends: 1680 [2024-11-19 09:09:01,131 INFO L226 Difference]: Without dead ends: 1680 [2024-11-19 09:09:01,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:09:01,132 INFO L432 NwaCegarLoop]: 1168 mSDtfsCounter, 825 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:01,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2596 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 09:09:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2024-11-19 09:09:01,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1478. [2024-11-19 09:09:01,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 998 states have (on average 1.8196392785571143) internal successors, (1816), 1469 states have internal predecessors, (1816), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:09:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1848 transitions. [2024-11-19 09:09:01,161 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1848 transitions. Word has length 27 [2024-11-19 09:09:01,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:01,162 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 1848 transitions. [2024-11-19 09:09:01,162 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 09:09:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1848 transitions. [2024-11-19 09:09:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 09:09:01,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:01,164 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 09:09:01,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:09:01,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:01,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:01,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1653190907, now seen corresponding path program 1 times [2024-11-19 09:09:01,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:01,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966606928] [2024-11-19 09:09:01,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:01,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:01,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:01,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966606928] [2024-11-19 09:09:01,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966606928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:09:01,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:09:01,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:09:01,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840077278] [2024-11-19 09:09:01,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:09:01,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:09:01,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:01,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:09:01,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:09:01,294 INFO L87 Difference]: Start difference. First operand 1478 states and 1848 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 09:09:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:01,349 INFO L93 Difference]: Finished difference Result 1478 states and 1844 transitions. [2024-11-19 09:09:01,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:09:01,351 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 09:09:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:01,357 INFO L225 Difference]: With dead ends: 1478 [2024-11-19 09:09:01,357 INFO L226 Difference]: Without dead ends: 1478 [2024-11-19 09:09:01,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:09:01,359 INFO L432 NwaCegarLoop]: 1343 mSDtfsCounter, 21 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:01,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3998 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:09:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2024-11-19 09:09:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1478. [2024-11-19 09:09:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 998 states have (on average 1.8156312625250501) internal successors, (1812), 1469 states have internal predecessors, (1812), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:09:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1844 transitions. [2024-11-19 09:09:01,385 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1844 transitions. Word has length 61 [2024-11-19 09:09:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:01,386 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 1844 transitions. [2024-11-19 09:09:01,386 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 09:09:01,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1844 transitions. [2024-11-19 09:09:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 09:09:01,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:01,387 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 09:09:01,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:09:01,388 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:01,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1854806959, now seen corresponding path program 1 times [2024-11-19 09:09:01,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:01,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187948559] [2024-11-19 09:09:01,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:01,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:01,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:01,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187948559] [2024-11-19 09:09:01,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187948559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:09:01,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:09:01,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:09:01,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39518646] [2024-11-19 09:09:01,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:09:01,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:09:01,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:01,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:09:01,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:09:01,490 INFO L87 Difference]: Start difference. First operand 1478 states and 1844 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 09:09:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:01,534 INFO L93 Difference]: Finished difference Result 1570 states and 1963 transitions. [2024-11-19 09:09:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:09:01,535 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 09:09:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:01,540 INFO L225 Difference]: With dead ends: 1570 [2024-11-19 09:09:01,541 INFO L226 Difference]: Without dead ends: 1570 [2024-11-19 09:09:01,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:09:01,542 INFO L432 NwaCegarLoop]: 1358 mSDtfsCounter, 54 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:01,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2689 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:09:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-11-19 09:09:01,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2024-11-19 09:09:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1090 states have (on average 1.771559633027523) internal successors, (1931), 1561 states have internal predecessors, (1931), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:09:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1963 transitions. [2024-11-19 09:09:01,590 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1963 transitions. Word has length 69 [2024-11-19 09:09:01,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:01,591 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 1963 transitions. [2024-11-19 09:09:01,591 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 09:09:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1963 transitions. [2024-11-19 09:09:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 09:09:01,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:01,592 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 09:09:01,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:09:01,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:01,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1907003630, now seen corresponding path program 1 times [2024-11-19 09:09:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:01,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169647152] [2024-11-19 09:09:01,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:01,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:02,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:02,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169647152] [2024-11-19 09:09:02,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169647152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:09:02,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:09:02,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:09:02,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054088118] [2024-11-19 09:09:02,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:09:02,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:09:02,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:02,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:09:02,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:09:02,033 INFO L87 Difference]: Start difference. First operand 1570 states and 1963 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 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 09:09:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:03,121 INFO L93 Difference]: Finished difference Result 1486 states and 1879 transitions. [2024-11-19 09:09:03,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:09:03,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 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 09:09:03,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:03,127 INFO L225 Difference]: With dead ends: 1486 [2024-11-19 09:09:03,128 INFO L226 Difference]: Without dead ends: 1486 [2024-11-19 09:09:03,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:09:03,129 INFO L432 NwaCegarLoop]: 611 mSDtfsCounter, 2272 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2278 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:03,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2278 Valid, 1223 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 09:09:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2024-11-19 09:09:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1213. [2024-11-19 09:09:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 817 states have (on average 1.6682986536107711) internal successors, (1363), 1204 states have internal predecessors, (1363), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:09:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1395 transitions. [2024-11-19 09:09:03,156 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1395 transitions. Word has length 72 [2024-11-19 09:09:03,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:03,157 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1395 transitions. [2024-11-19 09:09:03,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 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 09:09:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1395 transitions. [2024-11-19 09:09:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 09:09:03,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:03,161 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 09:09:03,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:09:03,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:03,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:03,164 INFO L85 PathProgramCache]: Analyzing trace with hash -954300764, now seen corresponding path program 1 times [2024-11-19 09:09:03,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:03,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137569518] [2024-11-19 09:09:03,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:03,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:03,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:03,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137569518] [2024-11-19 09:09:03,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137569518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:09:03,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:09:03,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:09:03,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728360080] [2024-11-19 09:09:03,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:09:03,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:09:03,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:03,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:09:03,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:09:03,418 INFO L87 Difference]: Start difference. First operand 1213 states and 1395 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 09:09:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:04,176 INFO L93 Difference]: Finished difference Result 1212 states and 1394 transitions. [2024-11-19 09:09:04,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:09:04,177 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 09:09:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:04,181 INFO L225 Difference]: With dead ends: 1212 [2024-11-19 09:09:04,181 INFO L226 Difference]: Without dead ends: 1212 [2024-11-19 09:09:04,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:09:04,182 INFO L432 NwaCegarLoop]: 1270 mSDtfsCounter, 2 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3620 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:04,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3620 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 09:09:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-11-19 09:09:04,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2024-11-19 09:09:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 817 states have (on average 1.6670746634026927) internal successors, (1362), 1203 states have internal predecessors, (1362), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:09:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1394 transitions. [2024-11-19 09:09:04,202 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1394 transitions. Word has length 77 [2024-11-19 09:09:04,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:04,203 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1394 transitions. [2024-11-19 09:09:04,204 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 09:09:04,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1394 transitions. [2024-11-19 09:09:04,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 09:09:04,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:04,208 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 09:09:04,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:09:04,208 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:04,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash -954300763, now seen corresponding path program 1 times [2024-11-19 09:09:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:04,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667605698] [2024-11-19 09:09:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:04,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:04,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:04,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667605698] [2024-11-19 09:09:04,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667605698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:09:04,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:09:04,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:09:04,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661533630] [2024-11-19 09:09:04,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:09:04,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:09:04,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:04,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:09:04,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:09:04,666 INFO L87 Difference]: Start difference. First operand 1212 states and 1394 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 09:09:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:05,689 INFO L93 Difference]: Finished difference Result 1211 states and 1393 transitions. [2024-11-19 09:09:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:09:05,690 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 09:09:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:05,694 INFO L225 Difference]: With dead ends: 1211 [2024-11-19 09:09:05,694 INFO L226 Difference]: Without dead ends: 1211 [2024-11-19 09:09:05,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:09:05,694 INFO L432 NwaCegarLoop]: 1270 mSDtfsCounter, 1 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3635 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:05,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3635 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 09:09:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2024-11-19 09:09:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1211. [2024-11-19 09:09:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 816 states have (on average 1.6678921568627452) internal successors, (1361), 1202 states have internal predecessors, (1361), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:09:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1393 transitions. [2024-11-19 09:09:05,713 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1393 transitions. Word has length 77 [2024-11-19 09:09:05,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:05,713 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1393 transitions. [2024-11-19 09:09:05,713 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 09:09:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1393 transitions. [2024-11-19 09:09:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 09:09:05,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:05,715 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 09:09:05,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:09:05,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:05,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:05,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1975894987, now seen corresponding path program 1 times [2024-11-19 09:09:05,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:05,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286757535] [2024-11-19 09:09:05,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:05,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:06,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:06,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286757535] [2024-11-19 09:09:06,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286757535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:09:06,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:09:06,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:09:06,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28892253] [2024-11-19 09:09:06,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:09:06,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:09:06,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:06,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:09:06,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:09:06,018 INFO L87 Difference]: Start difference. First operand 1211 states and 1393 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 09:09:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:07,327 INFO L93 Difference]: Finished difference Result 1223 states and 1411 transitions. [2024-11-19 09:09:07,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:09:07,328 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 09:09:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:07,333 INFO L225 Difference]: With dead ends: 1223 [2024-11-19 09:09:07,333 INFO L226 Difference]: Without dead ends: 1223 [2024-11-19 09:09:07,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:09:07,334 INFO L432 NwaCegarLoop]: 1253 mSDtfsCounter, 12 mSDsluCounter, 4338 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5591 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:07,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5591 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:09:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2024-11-19 09:09:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1217. [2024-11-19 09:09:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 821 states have (on average 1.66626065773447) internal successors, (1368), 1207 states have internal predecessors, (1368), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-19 09:09:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1406 transitions. [2024-11-19 09:09:07,353 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1406 transitions. Word has length 85 [2024-11-19 09:09:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:07,353 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1406 transitions. [2024-11-19 09:09:07,354 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 09:09:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1406 transitions. [2024-11-19 09:09:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 09:09:07,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:07,355 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 09:09:07,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:09:07,355 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:07,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1975894988, now seen corresponding path program 1 times [2024-11-19 09:09:07,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:07,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019839779] [2024-11-19 09:09:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:07,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:07,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019839779] [2024-11-19 09:09:07,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019839779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:09:07,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:09:07,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:09:07,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489044557] [2024-11-19 09:09:07,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:09:07,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:09:07,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:07,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:09:07,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:09:07,904 INFO L87 Difference]: Start difference. First operand 1217 states and 1406 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 09:09:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:09,164 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2024-11-19 09:09:09,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:09:09,165 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 09:09:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:09,171 INFO L225 Difference]: With dead ends: 1217 [2024-11-19 09:09:09,171 INFO L226 Difference]: Without dead ends: 1217 [2024-11-19 09:09:09,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:09:09,172 INFO L432 NwaCegarLoop]: 1260 mSDtfsCounter, 7 mSDsluCounter, 3348 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4608 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:09,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4608 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:09:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-19 09:09:09,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2024-11-19 09:09:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 821 states have (on average 1.6650426309378807) internal successors, (1367), 1207 states have internal predecessors, (1367), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-19 09:09:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1405 transitions. [2024-11-19 09:09:09,201 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1405 transitions. Word has length 85 [2024-11-19 09:09:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:09,201 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1405 transitions. [2024-11-19 09:09:09,201 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 09:09:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1405 transitions. [2024-11-19 09:09:09,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 09:09:09,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:09,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:09:09,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:09:09,204 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:09,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1271351474, now seen corresponding path program 1 times [2024-11-19 09:09:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124649187] [2024-11-19 09:09:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:09,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:09,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124649187] [2024-11-19 09:09:09,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124649187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912564785] [2024-11-19 09:09:09,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:09,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:09:09,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:09:09,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:09:09,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:09:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:09,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 09:09:09,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:09:09,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:09:10,116 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:09:10,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:09:10,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:09:10,191 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:10,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:09:10,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:09:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:10,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:09:10,285 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-19 09:09:10,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-19 09:09:10,299 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_501) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-19 09:09:10,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912564785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:10,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:09:10,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-19 09:09:10,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225653428] [2024-11-19 09:09:10,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:09:10,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:09:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:10,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:09:10,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-19 09:09:10,307 INFO L87 Difference]: Start difference. First operand 1217 states and 1405 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 09:09:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:12,613 INFO L93 Difference]: Finished difference Result 1216 states and 1404 transitions. [2024-11-19 09:09:12,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:09:12,613 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 09:09:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:12,618 INFO L225 Difference]: With dead ends: 1216 [2024-11-19 09:09:12,618 INFO L226 Difference]: Without dead ends: 1216 [2024-11-19 09:09:12,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-19 09:09:12,619 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 1168 mSDsluCounter, 5956 mSDsCounter, 0 mSdLazyCounter, 4696 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 6736 SdHoareTripleChecker+Invalid, 4727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:12,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 6736 Invalid, 4727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4696 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 09:09:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-19 09:09:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2024-11-19 09:09:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 821 states have (on average 1.6638246041412912) internal successors, (1366), 1206 states have internal predecessors, (1366), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-19 09:09:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1404 transitions. [2024-11-19 09:09:12,638 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1404 transitions. Word has length 86 [2024-11-19 09:09:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:12,639 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1404 transitions. [2024-11-19 09:09:12,639 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 09:09:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1404 transitions. [2024-11-19 09:09:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 09:09:12,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:12,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:09:12,660 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 09:09:12,840 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 09:09:12,841 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:12,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:12,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1271351475, now seen corresponding path program 1 times [2024-11-19 09:09:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:12,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100304347] [2024-11-19 09:09:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:13,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:13,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100304347] [2024-11-19 09:09:13,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100304347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:13,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423844957] [2024-11-19 09:09:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:13,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:09:13,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:09:13,558 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:09:13,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:09:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:13,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 09:09:13,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:09:13,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:09:13,918 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:09:13,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:09:13,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:09:13,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:09:14,120 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:14,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-19 09:09:14,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-19 09:09:14,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-19 09:09:14,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-19 09:09:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:14,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:09:14,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:09:14,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-11-19 09:09:14,372 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_629 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_630 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem50#1.offset| 25))))) is different from false [2024-11-19 09:09:14,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423844957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:14,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:09:14,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-19 09:09:14,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387883602] [2024-11-19 09:09:14,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:09:14,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 09:09:14,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:14,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 09:09:14,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2024-11-19 09:09:14,377 INFO L87 Difference]: Start difference. First operand 1216 states and 1404 transitions. Second operand has 19 states, 16 states have (on average 8.4375) internal successors, (135), 19 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:09:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:17,109 INFO L93 Difference]: Finished difference Result 1215 states and 1403 transitions. [2024-11-19 09:09:17,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:09:17,109 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 19 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-19 09:09:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:17,114 INFO L225 Difference]: With dead ends: 1215 [2024-11-19 09:09:17,114 INFO L226 Difference]: Without dead ends: 1215 [2024-11-19 09:09:17,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=505, Unknown=1, NotChecked=46, Total=650 [2024-11-19 09:09:17,115 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1169 mSDsluCounter, 5272 mSDsCounter, 0 mSdLazyCounter, 5378 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 6051 SdHoareTripleChecker+Invalid, 5427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 5378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:17,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 6051 Invalid, 5427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 5378 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 09:09:17,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-11-19 09:09:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1209. [2024-11-19 09:09:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 816 states have (on average 1.6654411764705883) internal successors, (1359), 1200 states have internal predecessors, (1359), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:09:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1391 transitions. [2024-11-19 09:09:17,133 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1391 transitions. Word has length 86 [2024-11-19 09:09:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:17,133 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1391 transitions. [2024-11-19 09:09:17,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 19 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:09:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1391 transitions. [2024-11-19 09:09:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 09:09:17,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:17,135 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 09:09:17,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:09:17,335 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 09:09:17,336 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:17,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:17,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1361370809, now seen corresponding path program 1 times [2024-11-19 09:09:17,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:17,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987215484] [2024-11-19 09:09:17,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:17,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:17,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:17,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987215484] [2024-11-19 09:09:17,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987215484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:09:17,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:09:17,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 09:09:17,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162708552] [2024-11-19 09:09:17,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:09:17,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:09:17,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:17,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:09:17,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:09:17,875 INFO L87 Difference]: Start difference. First operand 1209 states and 1391 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 09:09:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:20,109 INFO L93 Difference]: Finished difference Result 1219 states and 1407 transitions. [2024-11-19 09:09:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:09:20,110 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 09:09:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:20,117 INFO L225 Difference]: With dead ends: 1219 [2024-11-19 09:09:20,118 INFO L226 Difference]: Without dead ends: 1219 [2024-11-19 09:09:20,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-19 09:09:20,119 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1175 mSDsluCounter, 6660 mSDsCounter, 0 mSdLazyCounter, 5243 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 7439 SdHoareTripleChecker+Invalid, 5273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:20,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 7439 Invalid, 5273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5243 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 09:09:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-11-19 09:09:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1218. [2024-11-19 09:09:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 824 states have (on average 1.6614077669902914) internal successors, (1369), 1208 states have internal predecessors, (1369), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-19 09:09:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1407 transitions. [2024-11-19 09:09:20,151 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1407 transitions. Word has length 88 [2024-11-19 09:09:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:20,152 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1407 transitions. [2024-11-19 09:09:20,152 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 09:09:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1407 transitions. [2024-11-19 09:09:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 09:09:20,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:20,153 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 09:09:20,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 09:09:20,154 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:20,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1361370810, now seen corresponding path program 1 times [2024-11-19 09:09:20,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:20,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603200705] [2024-11-19 09:09:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:20,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:20,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603200705] [2024-11-19 09:09:20,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603200705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:09:20,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:09:20,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:09:20,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840225882] [2024-11-19 09:09:20,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:09:20,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:09:20,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:20,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:09:20,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:09:20,833 INFO L87 Difference]: Start difference. First operand 1218 states and 1407 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 09:09:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:22,593 INFO L93 Difference]: Finished difference Result 1218 states and 1406 transitions. [2024-11-19 09:09:22,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:09:22,594 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 09:09:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:22,597 INFO L225 Difference]: With dead ends: 1218 [2024-11-19 09:09:22,597 INFO L226 Difference]: Without dead ends: 1218 [2024-11-19 09:09:22,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:09:22,598 INFO L432 NwaCegarLoop]: 786 mSDtfsCounter, 1190 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 3627 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 3999 SdHoareTripleChecker+Invalid, 3656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:22,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 3999 Invalid, 3656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3627 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:09:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2024-11-19 09:09:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1218. [2024-11-19 09:09:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 824 states have (on average 1.6601941747572815) internal successors, (1368), 1208 states have internal predecessors, (1368), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-19 09:09:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1406 transitions. [2024-11-19 09:09:22,616 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1406 transitions. Word has length 88 [2024-11-19 09:09:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:22,617 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1406 transitions. [2024-11-19 09:09:22,617 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 09:09:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1406 transitions. [2024-11-19 09:09:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 09:09:22,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:22,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:09:22,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 09:09:22,618 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:22,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1810750578, now seen corresponding path program 1 times [2024-11-19 09:09:22,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:22,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063380334] [2024-11-19 09:09:22,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:23,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:23,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063380334] [2024-11-19 09:09:23,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063380334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:23,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304210527] [2024-11-19 09:09:23,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:23,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:09:23,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:09:23,177 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:09:23,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:09:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:23,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 09:09:23,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:09:23,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:09:23,530 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:09:23,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:09:23,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:09:23,599 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:23,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:09:23,647 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:23,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:09:23,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:09:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:23,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:09:23,675 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_879) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-19 09:09:23,682 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-19 09:09:23,720 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-19 09:09:23,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-19 09:09:23,729 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int)) (v_ArrVal_882 (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_882))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_879)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-19 09:09:23,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304210527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:23,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:09:23,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-19 09:09:23,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159184450] [2024-11-19 09:09:23,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:09:23,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:09:23,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:23,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:09:23,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=202, Unknown=3, NotChecked=90, Total=342 [2024-11-19 09:09:23,735 INFO L87 Difference]: Start difference. First operand 1218 states and 1406 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 09:09:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:26,565 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2024-11-19 09:09:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:09:26,565 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 09:09:26,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:26,568 INFO L225 Difference]: With dead ends: 1217 [2024-11-19 09:09:26,568 INFO L226 Difference]: Without dead ends: 1217 [2024-11-19 09:09:26,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650 [2024-11-19 09:09:26,569 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1162 mSDsluCounter, 8871 mSDsCounter, 0 mSdLazyCounter, 6774 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 9650 SdHoareTripleChecker+Invalid, 6804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 6774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:26,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 9650 Invalid, 6804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 6774 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 09:09:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-19 09:09:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2024-11-19 09:09:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 824 states have (on average 1.6589805825242718) internal successors, (1367), 1207 states have internal predecessors, (1367), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-19 09:09:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1405 transitions. [2024-11-19 09:09:26,590 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1405 transitions. Word has length 89 [2024-11-19 09:09:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:26,590 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1405 transitions. [2024-11-19 09:09:26,590 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 09:09:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1405 transitions. [2024-11-19 09:09:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 09:09:26,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:26,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:09:26,610 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 09:09:26,792 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 09:09:26,793 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:26,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:26,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1810750579, now seen corresponding path program 1 times [2024-11-19 09:09:26,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:26,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919332202] [2024-11-19 09:09:26,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:26,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:27,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:27,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919332202] [2024-11-19 09:09:27,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919332202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:27,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677636108] [2024-11-19 09:09:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:27,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:09:27,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:09:27,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:09:27,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:09:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:27,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 09:09:27,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:09:27,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:09:27,981 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:09:27,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:09:27,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:09:28,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:09:28,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 09:09:28,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 09:09:28,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:09:28,168 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:28,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 09:09:28,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 09:09:28,233 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:28,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 09:09:28,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 09:09:28,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:09:28,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:09:28,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:28,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:09:28,326 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 09:09:28,422 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025))) (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_1026) .cse1 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-19 09:09:28,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677636108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:28,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:09:28,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-19 09:09:28,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503365895] [2024-11-19 09:09:28,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:09:28,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 09:09:28,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:28,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 09:09:28,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=424, Unknown=11, NotChecked=86, Total=600 [2024-11-19 09:09:28,427 INFO L87 Difference]: Start difference. First operand 1217 states and 1405 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 09:09:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:31,993 INFO L93 Difference]: Finished difference Result 1224 states and 1412 transitions. [2024-11-19 09:09:31,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:09:31,993 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 09:09:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:31,996 INFO L225 Difference]: With dead ends: 1224 [2024-11-19 09:09:31,996 INFO L226 Difference]: Without dead ends: 1224 [2024-11-19 09:09:31,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=627, Unknown=11, NotChecked=106, Total=870 [2024-11-19 09:09:31,997 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 1166 mSDsluCounter, 6809 mSDsCounter, 0 mSdLazyCounter, 7616 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 7593 SdHoareTripleChecker+Invalid, 7649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 7616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:31,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 7593 Invalid, 7649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 7616 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-19 09:09:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2024-11-19 09:09:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1212. [2024-11-19 09:09:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 820 states have (on average 1.6609756097560975) internal successors, (1362), 1202 states have internal predecessors, (1362), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:09:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1394 transitions. [2024-11-19 09:09:32,014 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1394 transitions. Word has length 89 [2024-11-19 09:09:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:32,015 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1394 transitions. [2024-11-19 09:09:32,016 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 09:09:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1394 transitions. [2024-11-19 09:09:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 09:09:32,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:32,017 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 09:09:32,056 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 09:09:32,217 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 09:09:32,218 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:32,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:32,218 INFO L85 PathProgramCache]: Analyzing trace with hash -777793486, now seen corresponding path program 1 times [2024-11-19 09:09:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:32,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124702007] [2024-11-19 09:09:32,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:32,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:32,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:32,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124702007] [2024-11-19 09:09:32,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124702007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:09:32,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:09:32,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 09:09:32,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91794475] [2024-11-19 09:09:32,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:09:32,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 09:09:32,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:32,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 09:09:32,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:09:32,812 INFO L87 Difference]: Start difference. First operand 1212 states and 1394 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 09:09:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:34,963 INFO L93 Difference]: Finished difference Result 1228 states and 1416 transitions. [2024-11-19 09:09:34,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:09:34,963 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 09:09:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:34,966 INFO L225 Difference]: With dead ends: 1228 [2024-11-19 09:09:34,967 INFO L226 Difference]: Without dead ends: 1228 [2024-11-19 09:09:34,967 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 09:09:34,968 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 1192 mSDsluCounter, 5958 mSDsCounter, 0 mSdLazyCounter, 4717 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 6736 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:34,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 6736 Invalid, 4747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4717 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 09:09:34,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-19 09:09:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1224. [2024-11-19 09:09:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 831 states have (on average 1.654632972322503) internal successors, (1375), 1213 states have internal predecessors, (1375), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-19 09:09:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1408 transitions. [2024-11-19 09:09:34,985 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1408 transitions. Word has length 91 [2024-11-19 09:09:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:34,985 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1408 transitions. [2024-11-19 09:09:34,985 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 09:09:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1408 transitions. [2024-11-19 09:09:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 09:09:34,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:34,986 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 09:09:34,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 09:09:34,987 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:34,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:34,987 INFO L85 PathProgramCache]: Analyzing trace with hash -777793485, now seen corresponding path program 1 times [2024-11-19 09:09:34,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:34,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806237359] [2024-11-19 09:09:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:34,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:35,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:35,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806237359] [2024-11-19 09:09:35,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806237359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:09:35,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:09:35,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 09:09:35,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404585896] [2024-11-19 09:09:35,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:09:35,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:09:35,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:35,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:09:35,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:09:35,743 INFO L87 Difference]: Start difference. First operand 1224 states and 1408 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 09:09:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:38,110 INFO L93 Difference]: Finished difference Result 1227 states and 1415 transitions. [2024-11-19 09:09:38,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:09:38,112 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 09:09:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:38,115 INFO L225 Difference]: With dead ends: 1227 [2024-11-19 09:09:38,115 INFO L226 Difference]: Without dead ends: 1227 [2024-11-19 09:09:38,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-19 09:09:38,116 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 1172 mSDsluCounter, 4353 mSDsCounter, 0 mSdLazyCounter, 5014 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 5138 SdHoareTripleChecker+Invalid, 5043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:38,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 5138 Invalid, 5043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5014 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 09:09:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-11-19 09:09:38,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1224. [2024-11-19 09:09:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 831 states have (on average 1.6534296028880866) internal successors, (1374), 1213 states have internal predecessors, (1374), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-19 09:09:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1407 transitions. [2024-11-19 09:09:38,136 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1407 transitions. Word has length 91 [2024-11-19 09:09:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:38,136 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1407 transitions. [2024-11-19 09:09:38,137 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 09:09:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1407 transitions. [2024-11-19 09:09:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 09:09:38,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:38,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:09:38,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 09:09:38,138 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:38,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:38,139 INFO L85 PathProgramCache]: Analyzing trace with hash -718156839, now seen corresponding path program 1 times [2024-11-19 09:09:38,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:38,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768528852] [2024-11-19 09:09:38,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:38,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:38,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:38,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768528852] [2024-11-19 09:09:38,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768528852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:38,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158328963] [2024-11-19 09:09:38,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:38,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:09:38,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:09:38,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:09:38,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 09:09:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:38,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 09:09:38,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:09:38,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:09:39,059 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:09:39,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:09:39,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:09:39,112 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:39,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:09:39,156 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:39,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:09:39,202 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:39,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:09:39,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:09:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:39,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:09:39,270 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (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_1300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-19 09:09:39,322 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1299))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1300)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 09:09:39,390 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-19 09:09:39,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-11-19 09:09:39,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1303))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1299)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1300)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-19 09:09:39,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158328963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:39,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:09:39,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2024-11-19 09:09:39,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712089493] [2024-11-19 09:09:39,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:09:39,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:09:39,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:39,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:09:39,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=304, Unknown=22, NotChecked=114, Total=506 [2024-11-19 09:09:39,403 INFO L87 Difference]: Start difference. First operand 1224 states and 1407 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 09:09:41,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:41,790 INFO L93 Difference]: Finished difference Result 1226 states and 1414 transitions. [2024-11-19 09:09:41,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 09:09:41,790 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 09:09:41,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:41,793 INFO L225 Difference]: With dead ends: 1226 [2024-11-19 09:09:41,793 INFO L226 Difference]: Without dead ends: 1226 [2024-11-19 09:09:41,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=618, Unknown=22, NotChecked=162, Total=930 [2024-11-19 09:09:41,794 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 1164 mSDsluCounter, 7379 mSDsCounter, 0 mSdLazyCounter, 5772 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 8157 SdHoareTripleChecker+Invalid, 5802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:41,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 8157 Invalid, 5802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5772 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 09:09:41,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-11-19 09:09:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1223. [2024-11-19 09:09:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 831 states have (on average 1.6522262334536704) internal successors, (1373), 1212 states have internal predecessors, (1373), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-19 09:09:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1406 transitions. [2024-11-19 09:09:41,809 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1406 transitions. Word has length 92 [2024-11-19 09:09:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:41,809 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1406 transitions. [2024-11-19 09:09:41,809 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 09:09:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1406 transitions. [2024-11-19 09:09:41,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 09:09:41,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:41,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:09:41,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 09:09:42,014 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 09:09:42,015 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:42,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash -718156838, now seen corresponding path program 1 times [2024-11-19 09:09:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:42,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643424668] [2024-11-19 09:09:42,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:42,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:42,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643424668] [2024-11-19 09:09:42,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643424668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:42,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120839180] [2024-11-19 09:09:42,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:42,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:09:42,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:09:42,862 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:09:42,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 09:09:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:43,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-19 09:09:43,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:09:43,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:09:43,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:09:43,198 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:09:43,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:09:43,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 09:09:43,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:09:43,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 09:09:43,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:09:43,333 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:43,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 09:09:43,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 09:09:43,392 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:43,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 09:09:43,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 09:09:43,441 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:43,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 09:09:43,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 09:09:43,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:09:43,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:09:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:43,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:09:43,517 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 09:09:43,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-19 09:09:43,545 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-19 09:09:43,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2024-11-19 09:09:43,637 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1452))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460) .cse0 v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460) .cse5 v_ArrVal_1453) (select (select (store .cse6 .cse5 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2024-11-19 09:09:43,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120839180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:43,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:09:43,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2024-11-19 09:09:43,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203571930] [2024-11-19 09:09:43,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:09:43,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:09:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:43,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:09:43,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2024-11-19 09:09:43,641 INFO L87 Difference]: Start difference. First operand 1223 states and 1406 transitions. Second operand has 18 states, 16 states have (on average 8.625) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:09:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:47,223 INFO L93 Difference]: Finished difference Result 1225 states and 1413 transitions. [2024-11-19 09:09:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:09:47,224 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.625) internal successors, (138), 18 states have internal predecessors, (138), 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 92 [2024-11-19 09:09:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:47,226 INFO L225 Difference]: With dead ends: 1225 [2024-11-19 09:09:47,226 INFO L226 Difference]: Without dead ends: 1225 [2024-11-19 09:09:47,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2024-11-19 09:09:47,227 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 1164 mSDsluCounter, 6053 mSDsCounter, 0 mSdLazyCounter, 7108 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 6836 SdHoareTripleChecker+Invalid, 7155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 7108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:47,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 6836 Invalid, 7155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 7108 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-19 09:09:47,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-19 09:09:47,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1210. [2024-11-19 09:09:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 820 states have (on average 1.6585365853658536) internal successors, (1360), 1200 states have internal predecessors, (1360), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:09:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1392 transitions. [2024-11-19 09:09:47,262 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1392 transitions. Word has length 92 [2024-11-19 09:09:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:47,263 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1392 transitions. [2024-11-19 09:09:47,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.625) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:09:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1392 transitions. [2024-11-19 09:09:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 09:09:47,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:47,264 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 09:09:47,284 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 09:09:47,465 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 09:09:47,466 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:47,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:47,467 INFO L85 PathProgramCache]: Analyzing trace with hash 103439168, now seen corresponding path program 1 times [2024-11-19 09:09:47,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:47,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292670670] [2024-11-19 09:09:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:47,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:48,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:48,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292670670] [2024-11-19 09:09:48,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292670670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:09:48,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:09:48,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 09:09:48,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649740396] [2024-11-19 09:09:48,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:09:48,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:09:48,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:48,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:09:48,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-19 09:09:48,081 INFO L87 Difference]: Start difference. First operand 1210 states and 1392 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 09:09:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:50,141 INFO L93 Difference]: Finished difference Result 1229 states and 1417 transitions. [2024-11-19 09:09:50,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 09:09:50,142 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 09:09:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:50,144 INFO L225 Difference]: With dead ends: 1229 [2024-11-19 09:09:50,145 INFO L226 Difference]: Without dead ends: 1229 [2024-11-19 09:09:50,145 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 09:09:50,146 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1195 mSDsluCounter, 5950 mSDsCounter, 0 mSdLazyCounter, 4714 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 6727 SdHoareTripleChecker+Invalid, 4744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:50,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 6727 Invalid, 4744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4714 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 09:09:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2024-11-19 09:09:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1225. [2024-11-19 09:09:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 834 states have (on average 1.6498800959232613) internal successors, (1376), 1214 states have internal predecessors, (1376), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-19 09:09:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1409 transitions. [2024-11-19 09:09:50,163 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1409 transitions. Word has length 94 [2024-11-19 09:09:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:50,163 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1409 transitions. [2024-11-19 09:09:50,163 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 09:09:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1409 transitions. [2024-11-19 09:09:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 09:09:50,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:50,164 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 09:09:50,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 09:09:50,165 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:50,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:50,165 INFO L85 PathProgramCache]: Analyzing trace with hash 103439169, now seen corresponding path program 1 times [2024-11-19 09:09:50,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:50,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75676254] [2024-11-19 09:09:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:50,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:50,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75676254] [2024-11-19 09:09:50,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75676254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:09:50,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:09:50,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 09:09:50,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652256760] [2024-11-19 09:09:50,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:09:50,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:09:50,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:50,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:09:50,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:09:50,992 INFO L87 Difference]: Start difference. First operand 1225 states and 1409 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 09:09:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:53,291 INFO L93 Difference]: Finished difference Result 1228 states and 1416 transitions. [2024-11-19 09:09:53,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:09:53,291 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 09:09:53,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:53,294 INFO L225 Difference]: With dead ends: 1228 [2024-11-19 09:09:53,294 INFO L226 Difference]: Without dead ends: 1228 [2024-11-19 09:09:53,295 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 09:09:53,295 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 1173 mSDsluCounter, 4501 mSDsCounter, 0 mSdLazyCounter, 4856 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 5285 SdHoareTripleChecker+Invalid, 4885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:53,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 5285 Invalid, 4885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4856 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 09:09:53,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-19 09:09:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2024-11-19 09:09:53,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 834 states have (on average 1.6486810551558753) internal successors, (1375), 1214 states have internal predecessors, (1375), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-19 09:09:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1408 transitions. [2024-11-19 09:09:53,335 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1408 transitions. Word has length 94 [2024-11-19 09:09:53,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:53,335 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1408 transitions. [2024-11-19 09:09:53,336 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 09:09:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1408 transitions. [2024-11-19 09:09:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 09:09:53,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:53,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:09:53,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 09:09:53,337 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:53,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:53,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1377670599, now seen corresponding path program 1 times [2024-11-19 09:09:53,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:53,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835465420] [2024-11-19 09:09:53,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:53,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:53,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:53,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835465420] [2024-11-19 09:09:53,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835465420] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:53,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140088650] [2024-11-19 09:09:53,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:53,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:09:53,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:09:53,963 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:09:53,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 09:09:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:54,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 09:09:54,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:09:54,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:09:54,302 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:09:54,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:09:54,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:09:54,396 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:54,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:09:54,442 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:54,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:09:54,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:54,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:09:54,534 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:54,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:09:54,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:09:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:54,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:09:54,660 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 09:09:54,668 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1758))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 09:09:54,744 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-19 09:09:54,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-19 09:09:54,751 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (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_1763))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1758)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-19 09:09:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140088650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:54,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:09:54,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2024-11-19 09:09:54,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755518740] [2024-11-19 09:09:54,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:09:54,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 09:09:54,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:54,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 09:09:54,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=520, Unknown=44, NotChecked=150, Total=812 [2024-11-19 09:09:54,755 INFO L87 Difference]: Start difference. First operand 1225 states and 1408 transitions. Second operand has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:09:57,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:09:57,947 INFO L93 Difference]: Finished difference Result 1227 states and 1415 transitions. [2024-11-19 09:09:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:09:57,948 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2024-11-19 09:09:57,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:09:57,950 INFO L225 Difference]: With dead ends: 1227 [2024-11-19 09:09:57,950 INFO L226 Difference]: Without dead ends: 1227 [2024-11-19 09:09:57,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=965, Unknown=53, NotChecked=204, Total=1406 [2024-11-19 09:09:57,951 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1164 mSDsluCounter, 9643 mSDsCounter, 0 mSdLazyCounter, 7262 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 10420 SdHoareTripleChecker+Invalid, 7307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 7262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:09:57,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 10420 Invalid, 7307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 7262 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-19 09:09:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-11-19 09:09:57,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1224. [2024-11-19 09:09:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 834 states have (on average 1.6474820143884892) internal successors, (1374), 1213 states have internal predecessors, (1374), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-19 09:09:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1407 transitions. [2024-11-19 09:09:57,966 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1407 transitions. Word has length 95 [2024-11-19 09:09:57,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:09:57,966 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1407 transitions. [2024-11-19 09:09:57,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:09:57,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1407 transitions. [2024-11-19 09:09:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 09:09:57,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:09:57,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:09:57,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 09:09:58,168 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 09:09:58,169 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 09:09:58,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:09:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1377670598, now seen corresponding path program 1 times [2024-11-19 09:09:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:09:58,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509252840] [2024-11-19 09:09:58,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:58,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:09:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:59,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:09:59,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509252840] [2024-11-19 09:09:59,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509252840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:59,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500004950] [2024-11-19 09:09:59,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:09:59,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:09:59,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:09:59,071 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:09:59,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 09:09:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:09:59,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-19 09:09:59,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:09:59,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:09:59,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:09:59,406 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:09:59,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:09:59,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:09:59,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 09:09:59,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 09:09:59,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:09:59,537 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:59,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 09:09:59,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 09:09:59,610 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:59,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 09:09:59,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 09:09:59,664 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:59,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 09:09:59,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 09:09:59,710 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:09:59,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 09:09:59,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 09:09:59,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:09:59,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:09:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:09:59,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:09:59,777 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 09:09:59,784 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-19 09:09:59,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-19 09:09:59,805 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-19 09:09:59,825 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1924) .cse0 v_ArrVal_1927) (select (select (store .cse1 .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1926))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1924) .cse3 v_ArrVal_1927) .cse4 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-19 09:09:59,841 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1926))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse4 v_ArrVal_1927) .cse5 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-19 09:09:59,937 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1925))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1926))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse5 v_ArrVal_1924) .cse6 v_ArrVal_1927) .cse7 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-19 09:09:59,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500004950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:09:59,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:09:59,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2024-11-19 09:09:59,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64807243] [2024-11-19 09:09:59,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:09:59,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 09:09:59,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:09:59,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 09:09:59,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=394, Unknown=7, NotChecked=322, Total=812 [2024-11-19 09:09:59,943 INFO L87 Difference]: Start difference. First operand 1224 states and 1407 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)